Geoffrey L. Burn

Publication Activity (10 Years)

Years Active: 1985-1996
Publications (10 Years): 0

Publications

Geoffrey L. Burn, Daniel Le Métayer
Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis. J. Funct. Program. 6 (1) (1996)
Sigbjørn Finne, Geoffrey L. Burn
Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine. FPCA (1993)
Geoffrey L. Burn, Daniel Le Métayer
Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. PLILP (1993)
Kevin Hammond, Geoffrey L. Burn, Denis B. Howe
Spiking Your Caches. Functional Programming (1993)
David R. Lester, Geoffrey L. Burn
An Executable Specification of the HDG-Machine. Int. J. High Speed Comput. 5 (3) (1993)
Juarez Muylaert Filho, Geoffrey L. Burn
Continuation Passing Transformation and Abstract Interpretation. Theory and Formal Methods (1993)
Denis B. Howe, Geoffrey L. Burn
Using Strictness in the STG Machine. Functional Programming (1993)
Geoffrey L. Burn
The Abstract Interpretation of Functional Languages. Theory and Formal Methods (1993)
Geoffrey L. Burn
A Logical Framework for Program Analysis. Functional Programming (1992)
Geoffrey L. Burn
Implementing the Evaluation Transformer Model of Reduction on Parallel Machines. J. Funct. Program. 1 (3) (1991)
Geoffrey L. Burn
The Abstract interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary). Functional Programming (1991)
Geoffrey L. Burn
The Evaluation Transformer Model of Reduction and Its Correctness. TAPSOFT, Vol.2 (1991)
Hugh Kingdon, David R. Lester, Geoffrey L. Burn
The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network. Comput. J. 34 (4) (1991)
Geoffrey L. Burn
Using Projection Analysis of Evaluation-Order and Its Application. LISP and Functional Programming (1990)
Geoffrey L. Burn
A Relationship Between Abstract Interpretation and Projection Analysis. POPL (1990)
Geoffrey L. Burn
Overview of a Parallel Reduction Machine Project II. PARLE (1) (1989)
David I. Bevan, Geoffrey L. Burn, R. J. Karia, J. D. Robson
Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction. Comput. J. 32 (5) (1989)
Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones
A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56 (1988)
Geoffrey L. Burn, Simon L. Peyton Jones, J. D. Robson
The Spineless G-Machine. LISP and Functional Programming (1988)
Geoffrey L. Burn
Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract). FPCA (1987)
David I. Bevan, Geoffrey L. Burn, R. J. Karia
Overview of a Parallel Reduction Machine Project. PARLE (1) (1987)
Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones
A Safe Approach to Parallel Combinator Reduction (Extended Abstract). ESOP (1986)
Geoffrey L. Burn, Chris Hankin, Samson Abramsky
Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7 (3) (1986)
Geoffrey L. Burn, Chris Hankin, Samson Abramsky
The theory of strictness analysis for higher order functions. Programs as Data Objects (1985)