The theory of strictness analysis for higher order functions. - Geoffrey Livingston Burn; Chris Hankin; Samson Abramsky (Programs as Data Objects, 1985)

A Safe Approach to Parallel Combinator Reduction (Extended Abstract). - Chris Hankin; Geoffrey Livingston Burn; Simon L. Peyton Jones (ESOP, 1986)

Strictness Analysis for Higher-Order Functions. - Geoffrey Livingston Burn; Chris Hankin; Samson Abramsky (Sci. Comput. Program., 1986)

Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract). - Geoffrey Livingston Burn (FPCA, 1987)

Overview of a Parallel Reduction Machine Project. - David I. Bevan; Geoffrey Livingston Burn; R. J. Karia (PARLE (1), 1987)

Abstract interpretation and the parallel evaluation of functional languages. - Geoffrey Livingston Burn (1987)

The Spineless G-Machine. - Geoffrey Livingston Burn; Simon L. Peyton Jones; J. D. Robson (LISP and Functional Programming, 1988)

A Safe Approach to Parallel Combinator Reduction. - Chris Hankin; Geoffrey Livingston Burn; Simon L. Peyton Jones (Theor. Comput. Sci., 1988)

Overview of a Parallel Reduction Machine Project II. - Geoffrey Livingston Burn (PARLE (1), 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)

Using Projection Analysis of Evaluation-Order and Its Application. - Geoffrey Livingston Burn (LISP and Functional Programming, 1990)

A Relationship Between Abstract Interpretation and Projection Analysis. - Geoffrey Livingston Burn (POPL, 1990)

Lazy functional languages - abstract interpretation and compilation. - Geoffrey Livingston Burn (Pitman, 1991)

The Abstract interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary). - Geoffrey Livingston Burn (Functional Programming, 1991)

The Evaluation Transformer Model of Reduction and Its Correctness. - Geoffrey Livingston Burn (TAPSOFT, Vol.2, 1991)

The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network. - Hugh Kingdon; David R. Lester; Geoffrey Livingston Burn (Comput. J., 1991)

Implementing the Evaluation Transformer Model of Reduction on Parallel Machines. - Geoffrey Livingston Burn (J. Funct. Program., 1991)

A Logical Framework for Program Analysis. - Geoffrey Livingston Burn (Functional Programming, 1992)

Spiking Your Caches. - Kevin Hammond; Geoffrey Livingston Burn; Denis B. Howe (Functional Programming, 1993)

Using Strictness in the STG Machine. - Denis B. Howe; Geoffrey Livingston Burn (Functional Programming, 1993)

Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine. - Sigbjørn Finne; Geoffrey Livingston Burn (FPCA, 1993)

The Abstract Interpretation of Functional Languages. - Geoffrey Livingston Burn (Theory and Formal Methods, 1993)

Continuation Passing Transformation and Abstract Interpretation. - Juarez Muylaert Filho; Geoffrey Livingston Burn (Theory and Formal Methods, 1993)

Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. - Geoffrey Livingston Burn; Daniel Le Métayer (PLILP, 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 Optimisations Based on a Global Analysis: A Study of Strictness Analysis. - Geoffrey Livingston Burn; Daniel Le Métayer (J. Funct. Program., 1996)