Metacircularity in the polymorphic \(\lambda\)-calculus

DOI10.1016/0304-3975(90)90109-UzbMath0736.03003OpenAlexW2018926799MaRDI QIDQ1177938

S. Singh

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90109-u

zbMATH Keywords

abstractionsmetacircularitypolymorphic lambda-calculus

Mathematics Subject Classification ID

Theory of programming languages (68N15) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Syntax for Free: Representing Syntax with Binding Using Parametricity ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ Higher-order substitutions ⋮ Efficient self-interpretation in lambda calculus

Uses Software

• LEGO

Cites Work

• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• The calculus of constructions
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Inductively defined types in the Calculus of Constructions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item