See this document in CiteSeerX!

A Unified Approach to Strictness Analysis and Optimising Transformations (1996)  (Make Corrections)  (1 citation)
P. N. Benton
University of Cambridge Computer Laboratory



  Home/Search   Context   Related

 
View or download:
cl.cam.ac.uk/users/...stricttrans.ps.gz
daimi.aau.dk/~bra8130/L...CAMCL12.ps.Z
cl.cam.ac.uk/~am/gr...stricttrans.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cl.cam.ac.uk/users/am...CAMCLpubl (more)
From:  daimi.aau.dk/~b...OMAPS_abstracts
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present an inference system for translating programs in a PCF-like source language into a variant of Moggi's computational lambda calculus. This translation combines a simple strictness analysis with its associated optimising transformations into a single system. The correctness of the translation is established using a logical relation between the denotational semantics of the source and target languages. (Update)

Context of citations to this paper:   More

...types, modifies the simulation of call by name within call by value [25, 9] to minimise the number of suspensions, or thunks. Benton [3] presents optimising transformation rules that extend a strictness type system, as we attempt in this paper. A common limitation is that...

Cited by:   More
Compiling Laziness Using Projection Types - Baker-Finch   (Correct)

Similar documents (at the sentence level):
64.5%:   A Unified Approach to Strictness Analysis and Optimising.. - Benton (1996)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Type Theory and Projections for Higher-Order Static Analysis - Baker-Finch   (Correct)
0.4:   Type Theory and Projections for Static Analysis - Baker-Finch (1995)   (Correct)
0.1:   Proving the Correctness of Compiler Optimisations Based on .. - Burn, Métayer (1993)   (Correct)

Similar documents based on text:   More   All
0.4:   Recent Filesystem Optimisations in FreeBSD - Dowse, Malone (2002)   (Correct)
0.3:   Proving the Correctness of Compiler Optimisations Based on .. - Burn, Métayer (1995)   (Correct)
0.3:   Cps-Translation and the Correctness of Optimising Compilers - Burn, Métayer (1992)   (Correct)

BibTeX entry:   (Update)

Nick Benton. A unified approach to strictness analysis and optimising transformations. Technical Report 388, University of Cambridge Computer Laboratory, 1996. http://citeseer.ist.psu.edu/article/benton96unified.html   More

@techreport{ benton96unified,
  author = "N. Benton",
  title = "A unified approach to strictness analysis and optimising transformations",
  number = "388";
  institution = "University of Cambridge Computer Laboratory",
  year = "1996",
  url = "citeseer.ist.psu.edu/article/benton96unified.html" }
Citations (may not include all citations):
369   Information and Computation (context) - Moggi, computation - 1991
306   LCF considered as a programming language (context) - Plotkin - 1977
291   Computational lambda-calculus and monads - Moggi - 1989
233   Computational interpretations of linear logic - Abramsky - 1990
194   The Formal Semantics of Programming Languages (context) - Winskel - 1993
162   Unboxed objects and polymorphic typing - Leroy - 1992
73   Unboxed values as first class citizens in a non-strict funct.. - Jones, Launchbury - 1991
71   Abstract Interpretation and Optimising Transformations for A.. (context) - Mycroft - 1981
51   Computational types from a logical perspective - Benton, Bierman et al. - 1995
49   Specifying the correctness of binding-time analysis (context) - Wand - 1993
36   Lazy Functional Languages: Abstract Interpretation and Compi.. (context) - Burn - 1991
35   CPS transformation after strictness analysis - Danvy, Hatcliff - 1993
33   The Noble Art of Linear Decorating (context) - Schellinx - 1994
32   ACM Transactions on Programming Languages and Systems (context) - Hudak, Young et al. - 1991
24   Strictness Analysis of Lazy Functional Programs (context) - Benton - 1992
19   The theory and practice of strictness analysis for higher-or.. (context) - Burn, Hankin et al. - 1986
19   Minimal thunkification - Amtoft - 1993
16   monads and the lambda calculus (context) - Benton, Wadler - 1995
13   Reduction Types and Intensionality in the Lambda-calculus (context) - Wright - 1992
13   Programming Metalogics with a Fixpoint Type - Crole - 1992
9   Context information for lazy code generation (context) - Nielson, Nielson - 1990
3   Relevant logic and strictness analysis (context) - Baker-Finch - 1992

Documents on the same site (http://www.cl.cam.ac.uk/users/am/grants/lomaps/CAMCLpubl.html):   More
Linear Logic, Monads, and the Lambda Calculus - Benton, Wadler (1995)   (Correct)
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models.. - Benton (1994)   (Correct)
Linear Logic, Monads and the Lambda Calculus - Benton, Wadler (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC