Geoffrey Livingston Burn

According to our database, Geoffrey Livingston Burn authored at least 26 papers between 1985 and 1996.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

1996

Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis.

Geoffrey Livingston Burn, Daniel Le Métayer

J. Funct. Program., 1996

1993

An Executable Specification of the HDG-Machine.

David R. Lester, Geoffrey Livingston Burn

Int. J. High Speed Comput., 1993

Proving the Correctness of Compiler Optimizations Based on Strictness Analysis.

Geoffrey Livingston Burn, Daniel Le Métayer

Proceedings of the Programming Language Implementation and Logic Programming, 1993

Continuation Passing Transformation and Abstract Interpretation.

Juarez Muylaert Filho, Geoffrey Livingston Burn

Proceedings of the Theory and Formal Methods 1993, 1993

The Abstract Interpretation of Functional Languages.

Geoffrey Livingston Burn

Proceedings of the Theory and Formal Methods 1993, 1993

Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine.

Sigbjørn Finne, Geoffrey Livingston Burn

Proceedings of the conference on Functional programming languages and computer architecture, 1993

Using Strictness in the STG Machine.

Denis B. Howe, Geoffrey Livingston Burn

Proceedings of the 1993 Glasgow Workshop on Functional Programming, 1993

Spiking Your Caches.

Kevin Hammond, Geoffrey Livingston Burn, Denis B. Howe

Proceedings of the 1993 Glasgow Workshop on Functional Programming, 1993

1992

A Logical Framework for Program Analysis.

Geoffrey Livingston Burn

Proceedings of the Functional Programming, 1992

1991

Implementing the Evaluation Transformer Model of Reduction on Parallel Machines.

Geoffrey Livingston Burn

J. Funct. Program., 1991

The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network.

Hugh Kingdon, David R. Lester, Geoffrey Livingston Burn

Comput. J., 1991

The Evaluation Transformer Model of Reduction and Its Correctness.

Geoffrey Livingston Burn

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

The Abstract interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary).

Geoffrey Livingston Burn

Proceedings of the Functional Programming, 1991

Lazy functional languages - abstract interpretation and compilation.

Geoffrey Livingston Burn

Research monographs in parallel and distributed computing, Pitman, ISBN: 978-0-273-08832-5, 1991

1990

A Relationship Between Abstract Interpretation and Projection Analysis.

Geoffrey Livingston Burn

Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

Using Projection Analysis of Evaluation-Order and Its Application.

Geoffrey Livingston Burn

Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

1989

Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction.

David I. Bevan, Geoffrey Livingston Burn, R. J. Karia, J. D. Robson

Comput. J., 1989

Overview of a Parallel Reduction Machine Project II.

Geoffrey Livingston Burn

Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

1988

A Safe Approach to Parallel Combinator Reduction.

Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones

Theor. Comput. Sci., 1988

The Spineless G-Machine.

Geoffrey Livingston Burn, Simon L. Peyton Jones, J. D. Robson

Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987

Abstract interpretation and the parallel evaluation of functional languages.

Geoffrey Livingston Burn

PhD thesis, 1987

Overview of a Parallel Reduction Machine Project.

David I. Bevan, Geoffrey Livingston Burn, R. J. Karia

Proceedings of the PARLE, 1987

Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract).

Geoffrey Livingston Burn

Proceedings of the Functional Programming Languages and Computer Architecture, 1987

1986

Strictness Analysis for Higher-Order Functions.

Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky

Sci. Comput. Program., 1986

A Safe Approach to Parallel Combinator Reduction (Extended Abstract).

Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones

Proceedings of the ESOP 86, 1986

1985

The theory of strictness analysis for higher order functions.

Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky

Proceedings of the Programs as Data Objects, 1985