Geoffrey L. Burn

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): 75-109 (1996)

David R. Lester, Geoffrey L. Burn: An Executable Specification of the HDG-Machine. International Journal of High Speed Computing 5(3): 327-378 (1993)

Sigbjorn Finne, Geoffrey L. Burn: Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine. FPCA 1993: 331-340

Geoffrey L. Burn: The Abstract Interpretation of Functional Languages. Theory and Formal Methods 1993: 3-14

Juarez Muylaert Filho, Geoffrey L. Burn: Continuation Passing Transformation and Abstract Interpretation. Theory and Formal Methods 1993: 247-259

Geoffrey L. Burn, Daniel Le Métayer: Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. PLILP 1993: 346-364

Geoffrey L. Burn, Simon J. Gay, Mark Ryan (Eds.): 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. Workshops in Computing, Springer 1993, isbn 3-540-19842-3

Geoffrey L. Burn: A Logical Framework for Program Analysis. Functional Programming 1992: 30-42

Geoffrey L. Burn: Lazy functional languages - abstract interpretation and compilation. Research monographs in parallel and distributed computing, Pitman 1991, isbn 978-0-273-08832-5, pp. 1-238

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

Geoffrey L. Burn: Implementing the Evaluation Transformer Model of Reduction on Parallel Machines. J. Funct. Program. 1(3): 329-366 (1991)

Geoffrey L. Burn: The Abstract interpretation of Higher-Order Functional Languages: From Properties to Absract Domains (Technical Summary). Functional Programming 1991: 56-72

Geoffrey L. Burn: The Evaluation Transformer Model of Reduction and Its Correctness. TAPSOFT, Vol.2 1991: 458-482

Geoffrey L. Burn: Using Projection Analysis of Evaluation-Order and Its Application. LISP and Functional Programming 1990: 227-240

Geoffrey L. Burn: A Relationship Between Abstract Interpretation and Projection Analysis. POPL 1990: 151-156

D. 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): 461-469 (1989)

Geoffrey L. Burn: Overview of a Parallel Reduction Machine Project II. PARLE (1) 1989: 385-396

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

Geoffrey L. Burn, Simon L. Peyton Jones, J. D. Robson: The Spineless G-Machine. LISP and Functional Programming 1988: 244-258

Geoffrey L. Burn: Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract). FPCA 1987: 446-470

D. I. Bevan, Geoffrey L. Burn, R. J. Karia: Overview of a Parallel Reduction Machine Project. PARLE (1) 1987: 394-413

Geoffrey L. Burn, Chris Hankin, Samson Abramsky: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986)

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

Geoffrey L. Burn, Chris Hankin, Samson Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62