Typed self-interpretation by pattern matching

DOI10.1145/2034773.2034808MaRDI QIDQ5176979zbMATH OpenOpenAlexFDO

Authors Jens Palsberg, Barry Jay

Publication date 5 March 2015

Published in Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2034773.2034808

zbMATH Keywords

pattern matchingself-interpretation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• Typed self-evaluation via intensional type functions
• Self-representation in Girard's System U
• Efficient self-interpretation in lambda calculus
• Linear-time self-interpretation of the pure lambda calculus
• Typed Tagless Final Interpreters

Cited in

(6)

• Intensional computation with higher-order functions
• Programs as data structures in \(\lambda\)SF-calculus
• Incorporating quotation and evaluation into Church's type theory
• Self-quotation in a typed, intensional lambda-calculus
• Intermediate representation of programs with type specification based on pattern matching
• Typed self-evaluation via intensional type functions

This page was built for publication: Typed self-interpretation by pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176979)