F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Theoretical Computer Science, 89:137--159, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1996) (16 citations) (Correct)
....difference is that she inverts the interpretation function into a Kripke model. This proof has also been given a categorical reconstruction by Altenkirch, Hofmann, and Streicher [2] Similar techniques as ours have also been considered for other purposes than normalization. Pfenning and Lee [26] considered a notion of metacircularity for the polymorphic calculus and defined an approximately metacircular interpreter similar to our intended semantics . Mogensen [24] considered similar notions for the untyped calculus intended to be used as a foundation for partial evaluation. He ....
F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Theoretical Computer Science, 89:137--159, 1991.
Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1998) (16 citations) (Correct)
....The answer is simple: it is exactly the strategy used at the meta level In a sense, the process of understanding is represented by the computation of the semantics of a term. Similar algorithms have also been considered in the context of metacircularity and partial evaluation. Pfenning and Lee [25] considered a notion of metacircularity for the polymorphic calculus and defined an approximately metacircular interpreter similar to our intended semantics . Mogensen [23] considered similar notions for the untyped calculus intended to be used as a foundation for partial evaluation. He ....
F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Theoretical Computer Science, 89:137--159, 1991.
Self-Interpretation and Reflection in a Statically Typed.. - Läufer, Odersky (Correct)
....program in the form of an eval function. Reflection is traditionally studied in untyped or dynamically typed languages such as LISP [4] 2] Smalltalk [3] or the l calculus [9] By contrast, we consider self interpretation and reflection in a statically typed metalanguage along the lines of [10] and [7] Since the language is statically typed, the data structure used as a representation for programs is statically typed as well. Reflection in a statically typed context can be characterized as follows: Type preserving representation: If a representation is well typed, then the represented ....
....To our knowledge, we are the first to implement a fully metacircular interpreter for a statically typed, Turing complete language. By contrast, the typed interpreter of [5] is based on a types as values assumption and hence relies on some form of dynamic typing. Pfenning and Lee present [10] an embedding of the types of in but stop short of true reflection of a language in itself. zero : Exp Int succ : Exp (Int Int) cond : Exp (Int a (Int a) a) s : Exp ( a b c) a b) a c) k : Exp (a b a) i : Exp (a a) y : Exp ( a a) a) evl : ....
F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Technical Report CMU-CS-89-207, CMU, December 1989.
Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1996) (16 citations) (Correct)
....difference is that she inverts the interpretation function into a Kripke model. This proof has also been given a categorical reconstruction by Altenkirch, Hofmann, and Streicher [2] Similar techniques as ours have also been considered for other purposes than normalization. Pfenning and Lee [26] considered a notion of metacircularity for the polymorphic calculus and defined an approximately metacircular interpreter similar to our intended semantics . Mogensen [24] considered similar notions for the untyped calculus intended to be used as a foundation for partial evaluation. He ....
F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Theoretical Computer Science, 89:137--159, 1991.
Self-Interpretation and Reflection in a Statically Typed.. - Läufer, Odersky (1993) (Correct)
....program in the form of an eval function. Reflection is traditionally studied in untyped or dynamically typed languages such as LISP [4] 2] Smalltalk [3] or the l calculus [9] By contrast, we consider self interpretation and reflection in a statically typed metalanguage along the lines of [10] and [7] Since the language is statically typed, the data structure used as a representation for programs is statically typed as well. Reflection in a statically typed context can be characterized as follows: Type preserving representation: If a representation is well typed, then the represented ....
....To our knowledge, we are the first to implement a fully metacircular interpreter for a statically typed, Turing complete language. By contrast, the typed interpreter of [5] is based on a types as values assumption and hence relies on some form of dynamic typing. Pfenning and Lee present [10] an embedding of the types of in but stop short of true reflection of a language in itself. We argued [7] that conventional statically typed object oriented languages were not sufficient to guarantee well typed expression syntax trees and described an alternative metalanguage based on F bounded ....
F. Pfenning and P. Lee. Metacircularity in the polymorphic lambda-calculus. Technical Report CMUCS -89-207, CMU, December 1989.
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