default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeoffrey Livingston Burn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j7]Geoffrey Livingston 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)- 1993
- [j6]David R. Lester, Geoffrey Livingston Burn:
An Executable Specification of the HDG-Machine. Int. J. High Speed Comput. 5(3): 327-378 (1993) - [c17]Kevin Hammond, Geoffrey Livingston Burn, Denis B. Howe:
Spiking Your Caches. Functional Programming 1993: 58-68 - [c16]Denis B. Howe, Geoffrey Livingston Burn:
Using Strictness in the STG Machine. Functional Programming 1993: 127-137 - [c15]Sigbjørn Finne, Geoffrey Livingston Burn:
Assessing the Evaluation Transformer Model of Reduction on the Spineless G-machine. FPCA 1993: 331-340 - [c14]Geoffrey Livingston Burn:
The Abstract Interpretation of Functional Languages. Theory and Formal Methods 1993: 3-14 - [c13]Juarez Muylaert Filho, Geoffrey Livingston Burn:
Continuation Passing Transformation and Abstract Interpretation. Theory and Formal Methods 1993: 247-259 - [c12]Geoffrey Livingston Burn, Daniel Le Métayer:
Proving the Correctness of Compiler Optimizations Based on Strictness Analysis. PLILP 1993: 346-364 - [e1]Geoffrey Livingston Burn, Simon J. Gay, Mark Ryan:
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 [contents] - 1992
- [c11]Geoffrey Livingston Burn:
A Logical Framework for Program Analysis. Functional Programming 1992: 30-42 - 1991
- [b2]Geoffrey Livingston 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 - [j5]Hugh Kingdon, David R. Lester, Geoffrey Livingston Burn:
The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network. Comput. J. 34(4): 290-301 (1991) - [j4]Geoffrey Livingston Burn:
Implementing the Evaluation Transformer Model of Reduction on Parallel Machines. J. Funct. Program. 1(3): 329-366 (1991) - [c10]Geoffrey Livingston Burn:
The Abstract interpretation of Higher-Order Functional Languages: From Properties to Abstract Domains (Technical Summary). Functional Programming 1991: 56-72 - [c9]Geoffrey Livingston Burn:
The Evaluation Transformer Model of Reduction and Its Correctness. TAPSOFT, Vol.2 1991: 458-482 - 1990
- [c8]Geoffrey Livingston Burn:
Using Projection Analysis of Evaluation-Order and Its Application. LISP and Functional Programming 1990: 227-240 - [c7]Geoffrey Livingston Burn:
A Relationship Between Abstract Interpretation and Projection Analysis. POPL 1990: 151-156
1980 – 1989
- 1989
- [j3]David I. Bevan
, Geoffrey Livingston 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) - [c6]Geoffrey Livingston Burn:
Overview of a Parallel Reduction Machine Project II. PARLE (1) 1989: 385-396 - 1988
- [j2]Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones:
A Safe Approach to Parallel Combinator Reduction. Theor. Comput. Sci. 56: 17-36 (1988) - [c5]Geoffrey Livingston Burn, Simon L. Peyton Jones, J. D. Robson:
The Spineless G-Machine. LISP and Functional Programming 1988: 244-258 - 1987
- [b1]Geoffrey Livingston Burn:
Abstract interpretation and the parallel evaluation of functional languages. Imperial College London, UK, 1987 - [c4]Geoffrey Livingston Burn:
Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract). FPCA 1987: 446-470 - [c3]David I. Bevan, Geoffrey Livingston Burn, R. J. Karia:
Overview of a Parallel Reduction Machine Project. PARLE (1) 1987: 394-413 - 1986
- [j1]Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky:
Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986) - [c2]Chris Hankin, Geoffrey Livingston Burn, Simon L. Peyton Jones:
A Safe Approach to Parallel Combinator Reduction (Extended Abstract). ESOP 1986: 99-110 - 1985
- [c1]Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky:
The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
