Metacircularity in the polymorphic -calculus
From MaRDI portal
Metacircularity in the polymorphic \(\lambda\)-calculus
Recommendations
Cites work
- Automatic synthesis of typed -programs on term algebras
- scientific article; zbMATH DE number 4191621 (Why is no real title available?)
- scientific article; zbMATH DE number 3898200 (Why is no real title available?)
- scientific article; zbMATH DE number 4053566 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 4189687 (Why is no real title available?)
- Inductively defined types in the Calculus of Constructions
- Recursive functions of symbolic expressions and their computation by machine, Part I
- The calculus of constructions
Cited in
(7)- Higher-order substitutions
- scientific article; zbMATH DE number 6707782 (Why is no real title available?)
- Syntax for Free: Representing Syntax with Binding Using Parametricity
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
- Efficient self-interpretation in lambda calculus
- Typed self-evaluation via intensional type functions
- Meta-circular interpreter for a strongly typed language
This page was built for publication: Metacircularity in the polymorphic \(\lambda\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177938)