John Hannan  Home/Search
Context Related
| daimi.aau.dk/~bra8130/TPA...hannan.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/~bra81...proceedings (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We consider the problem of analyzing and proving correct simple closure conversion strategies for a higher-order functional language. We specify the conversions as deductive systems, making use of annotated types to provide constraints which guide the construction of the closures. We exploit the ability of deductive systems to specify concisely complex relationships between source terms and closure-converted terms. The resulting specifications and proofs are relatively clear and... (Update)
Context of citations to this paper: More
.... of formal treatments of closure conversion, by modelling it as a translation of a lambda calculus into a calculus with closures [Han95, WS94, MMH96, MMH96]. Soundness proofs are established by proving the translation of a program operationally equivalent to the original...
Cited by: More
Typed Closure Conversion - Yasuhiko Minamide Greg (Correct)
Strongly Typed Flow-Directed Representation Transformations - Dimock, Muller, Turbak.. (1997) (Correct)
A Typed Intermediate Language for Flow-Directed Compilation - Wells, Dimock, Muller.. (1997) (Correct)
Active bibliography (related documents): More All
0.2: Implementing the Meta-Theory of Deductive Systems - Pfenning, Rohwedder (1992) (Correct)
0.1: A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992) (Correct)
0.1: A Proof of the Church-Rosser Theorem - And Its Representation (Correct)
Similar documents based on text: More All
0.1: Under consideration for publication in J. Functional.. - Department Of Computer (Correct)
0.1: Natural Semantics and Some of its Meta-Theory in Elf - Michaylov, Pfenning (1991) (Correct)
0.1: Elf: A Meta-Language for Deductive Systems (System Description) - Pfenning (Correct)
Related documents from co-citation: More All
17: Typed closure conversion - Minamide, Morrisett et al. - 1996
16: Compiling with Continuations (context) - Appel - 1992
11: closure-passing style (context) - Appel, Jim - 1989
BibTeX entry: (Update)
J. Hannan. A type system for closure conversion. In The Workshop on Types for Program Analysis, 1995. http://citeseer.ist.psu.edu/hannan95type.html More
@misc{ hannan95type,
author = "J. Hannan",
title = "A type system for closure conversion",
text = "J. Hannan. A type system for closure conversion. In The Workshop on Types
for Program Analysis, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/hannan95type.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992 ACM
210 Logic programming in the LF logical framework - Pfenning - 1991
96 An algorithm for testing conversion in type theory (context) - Coquand - 1991 ACM
89 closure-passing style (context) - Appel, Jim - 1989
71 Elf: A language for logic definition and verified metaprogra.. - Pfenning - 1989 ACM DBLP
40 Compiler verification in LF - Hannan, Pfenning - 1992 DBLP
22 Correctness of procedure representations in higher-order ass.. (context) - Wand - 1992 ACM DBLP
21 Proving the correctness of compiler optimisations based on s.. - rey, Daniel - 1993
11 cient closure representations (context) - Shao, Appel - 1994
7 A type-based analysis for stack allocation in functional lan.. (context) - Hannan - 1995
6 An implementation of the Elf core language in Standard ML (context) - Pfenning - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.aau.dk/~bra8130/TPA/proceedings.html): More
Effective Flow Analysis for Avoiding Run-Time Checks - Jagannathan, Wright (1995) (Correct)
A Calculus of Tagged Types, with applications to process.. - Berthomieu, de Sagazan (Correct)
Optimizing Lazy Functional Programs Using Flow Inference - Faxen (1995) (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