(Enter summary)
Abstract: Partial evaluation of an applied lambda calculus was done
some years ago in the lambda-mix project. When moving
to pure lambda calculus, some issues need to be considered,
most importantly how we represent programs in pure
lambda calculus. We start by presenting a compact representation
schema for -terms and show how this leads to
an exceedingly small and elegant self-interpreter. Partial
evaluation is discussed, and it is shown that partial evaluation
in the most general sense is uncomputable. ... (Update)
Context of citations to this paper: More
.... are lambda mix (Gomard [6, 8, 9] Gomard and Jones [10] and the partial evaluators for the pure lambda calculus found in (Mogensen [16, 17]) Sebastian C. Skalberg Chapter 3 Lambda mix In the present chapter, we present lambda mix in the form which we study in the...
...correctness using the main theorem. In Section 5 we compare the present work with related work, emphasizing the connection to [Bar91, Mog92b, Wan93] and to [Gri88] Section 6 sketches some future lines of research. Detailed proofs can be found in [Mul93] 2 Well Behaved Terms...
Cited by: More
Mechanical Proof of the Optimality of a Partial Evaluator - Skalberg (1999)
(Correct)
Partial Evaluation for the Lambda Calculus - Jones, Gomard, Sestoft
(Correct)
Jones Optimality, Binding-Time Improvements, and the Strength of.. - Glück
(Correct)
Similar documents (at the sentence level):
12.6%: Efficient Self-Interpretation in Lambda Calculus - Mogensen (1994)
(Correct)
Active bibliography (related documents): More All
0.8: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.5: Multi-Stage Programming: Its Theory and Applications - Taha (1999)
(Correct)
0.2: Efficient Type Inference for Higher-Order Binding-Time Analysis - Henglein (1991)
(Correct)
Similar documents based on text: More All
0.1: Static Analyses for the Effective Specialization of Realistic.. - Hornof (1997)
(Correct)
0.1: Controlled Self-Applicable On-Line Partial Evaluation, Using.. - Beckman, Kamin
(Correct)
0.1: Interpreting Specialization in Type Theory - Thiemann (1999)
(Correct)
Related documents from co-citation: More All
7: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
6: A partial evaluator for the untyped lambdacalculus
- Gomard, Jones - 1991
4: AND STRINGER-CALVERT (context) - OWRE, SHANKAR et al. - 1998
BibTeX entry: (Update)
T. Mogensen. Self-applicable partial evaluation for pure lambda calculus. In Partial Evaluation and Semantics-Based Program Manipulation, San Francisco, California, June 1992 (Technical Report YALEU/DCS/RR909) , pages 116--121. New Haven, CT: Yale University, 1992. http://citeseer.ist.psu.edu/mogensen92selfapplicable.html More
@inproceedings{ mogensen92selfapplicable,
author = "T. Mogensen",
title = "Self-Applicable Partial Evaluation for Pure Lambda Calculus",
booktitle = "Partial Evaluation and Seman\-tics-Based Program Manipulation, San Francisco, California, June 1992 (Technical Report {YALEU/{DCS}/{RR}}-909)",
publisher = "New Haven, CT:\ Yale University",
pages = "116--121",
year = "1992",
url = "citeseer.ist.psu.edu/mogensen92selfapplicable.html" }
Citations (may not include all citations):
179
Dynamic Typing (context) - Henglein - 1992
172
Higher-Order Abstract Syntax (context) - Pfenning, Elliot - 1988
99
A Partial Evaluator for the Untyped Lambda Calculus
- Gomard, Jones - 1991
80
The Scheme Programming Language (context) - Dybvig - 1987
63
Three Approaches to Type Structure (context) - Reynolds - 1985
35
Partial Type Inference for Untyped Functional Programs (context) - Gomard - 1990
9
A Self-Applicable Partial Evaluator for the Lambda Calculus (context) - Jones, Gomard et al. - 1990
7
Higher Order Partial Evaluation - HOPE for the Lambda Calcul.. (context) - Gomard - 1989
2
Efficient Self-interpretation in Lambda Calculus
- Mogensen - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/research-groups/topps/bibliography/1992.html): More
Generating a Compiler for a Lazy Language by Partial Evaluation - Jørgensen (1992)
(Correct)
Efficient Self-Interpretation in Lambda Calculus - Mogensen (1994)
(Correct)
Partial Evaluation and the Generation of Program Generators - Jones (1993)
(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