Geoffrey Livingston Burn

27 papers A* 1A 5Journal 7Unranked 11
YearRankTypeTitle / Venue / Authors
1996 J jnl
Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis.
J. Funct. Program.
Geoffrey Livingston Burn, Daniel Le Métayer
1993 J jnl
An Executable Specification of the HDG-Machine.
Int. J. High Speed Comput.
David R. Lester, Geoffrey Livingston Burn
1993 — conf
Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine.
FPCA
Sigbjørn Finne, Geoffrey Livingston Burn
1993 — conf
Continuation Passing Transformation and Abstract Interpretation.
Theory and Formal Methods
Juarez Muylaert Filho, Geoffrey Livingston Burn
1993 — conf
Proving the Correctness of Compiler Optimizations Based on Strictness Analysis.
PLILP
Geoffrey Livingston Burn, Daniel Le Métayer
1993 A conf
Spiking Your Caches.
Functional Programming
Kevin Hammond, Geoffrey Livingston Burn, Denis B. Howe
1993 — conf
The Abstract Interpretation of Functional Languages.
Theory and Formal Methods
Geoffrey Livingston Burn
1993 — ed.
Theory and Formal Methods 1993, Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Isle of Thorns Conference Centre, Chelwood Gate, Sussex, UK, 29-31 March 1993
Theory and Formal Methods
Geoffrey Livingston Burn, Simon J. Gay, Mark Ryan
1993 A conf
Using Strictness in the STG Machine.
Functional Programming
Denis B. Howe, Geoffrey Livingston Burn
1992 A conf
A Logical Framework for Program Analysis.
Functional Programming
Geoffrey Livingston Burn
1991 J jnl
Implementing the Evaluation Transformer Model of Reduction on Parallel Machines.
J. Funct. Program.
Geoffrey Livingston Burn
1991 — book
Lazy functional languages - abstract interpretation and compilation.
Geoffrey Livingston Burn
1991 A conf
The Abstract interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary).
Functional Programming
Geoffrey Livingston Burn
1991 — conf
The Evaluation Transformer Model of Reduction and Its Correctness.
TAPSOFT, Vol.2
Geoffrey Livingston Burn
1991 J jnl
The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network.
Comput. J.
Hugh Kingdon, David R. Lester, Geoffrey Livingston Burn
1990 A* conf
A Relationship Between Abstract Interpretation and Projection Analysis.
POPL
Geoffrey Livingston Burn
1990 — conf
Using Projection Analysis of Evaluation-Order and Its Application.
LISP and Functional Programming
Geoffrey Livingston Burn
1989 — conf
Overview of a Parallel Reduction Machine Project II.
PARLE (1)
Geoffrey Livingston Burn
1989 J jnl
Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction.
Comput. J.
David I. Bevan, Geoffrey Livingston Burn, R. J. Karia, J. D. Robson
1988 J jnl
A Safe Approach to Parallel Combinator Reduction.
Theor. Comput. Sci.
Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones
1988 — conf
The Spineless G-Machine.
LISP and Functional Programming
Geoffrey Livingston Burn, Simon L. Peyton Jones, J. D. Robson
1987 — —
Abstract interpretation and the parallel evaluation of functional languages.
Geoffrey Livingston Burn
1987 — conf
Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract).
FPCA
Geoffrey Livingston Burn
1987 — conf
Overview of a Parallel Reduction Machine Project.
PARLE (1)
David I. Bevan, Geoffrey Livingston Burn, R. J. Karia
1986 A conf
A Safe Approach to Parallel Combinator Reduction (Extended Abstract).
ESOP
Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones
1986 J jnl
Strictness Analysis for Higher-Order Functions.
Sci. Comput. Program.
Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky
1985 — conf
The theory of strictness analysis for higher order functions.
Programs as Data Objects
Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky