Mogensen, T. AE. Efficient self-interpretation in lambda calculus. Functional Programming 2, 3 (July 1992), 345--364. 166 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multi-Stage Programming: Its Theory and Applications - Taha (1999) (27 citations) (Correct)
....care to preserve the semantic distinctions at all is that exemplified by Essay V (though commonly with German or boldface Latin letters instead of Greek) Today, Quine s quasi quotes are a standard tool for distinguishing between object language terms and meta language terms. See for example [1, 16, 51]. 5 Footnotes in the following quotation will point out when a reference is numbered with respect to this dissertation (meta level) or to Quine s book (object level) Dwelling on this concrete example of problems that arise when we want to be formal about the semantics of multi level ....
Mogensen, T. AE. Efficient self-interpretation in lambda calculus. Functional Programming 2, 3 (July 1992), 345--364. 166
Self-applicable Partial Evaluation for Pure Lambda Calculus - Mogensen (1992) (10 citations) Self-citation (Mogensen) (Correct)
....calculus is an injective (up to identity) mapping d Deltae : NF . That is, d Deltae will represent any term by a term in normal form. Furthermore, the representations of two terms are identical iff the terms are. 2 A representation schema We will use the representation schema from [Mogensen 1992]. It uses a combination of higher order abstract syntax [Pfenning and Elliot 1988] and a well known way of representing signatures using terms. This is a combination of the usual representations of products and booleans in pure lambda calculus. Higher order abstract syntax is an abstract syntax ....
....terms are quite efficient using this representation, requiring only a few fi reductions each. 3 Self interpretation A self interpreter is a term E, such that E dMe = fi M for any term M . That is, E applied to the representation of M is equal to M itself. The self interpreter is taken from [Mogensen 1992], which also contains a proof of correctness. We will (for the sake of readability) initially present the self interpreter using recursive equations and higher order abstract syntax. Then we will use the coding from above to convert it into the pure lambda calculus. fi reduction of the ....
Mogensen, T. Efficient Self-interpretation in Lambda Calculus, to appear in Journal of Functional Programming.
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