Programs as data structures in \(\lambda\)SF-calculus

DOI10.1016/J.ENTCS.2016.09.040zbMath1394.68064OpenAlexW2528339563WikidataQ113317632 ScholiaQ113317632MaRDI QIDQ1744389

C. Barry Jay

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.040

zbMATH Keywords

lambda-calculusSF-calculusself-interpretationxi-rule

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Self-quotation in a typed, intensional lambda-calculus ⋮ Conflicting accounts of \(\lambda\)-definability

Uses Software

• Coq

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The self-reduction in lambda calculus
• \(\lambda\)-definability and recursiveness
• A combinatory account of internal structure
• First-class patterns
• Pattern Calculus
• Efficient self-interpretation in lambda calculus
• Introduction to generalized type systems
• Typed self-interpretation by pattern matching
• Linear-time self-interpretation of the pure lambda calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programs as data structures in \(\lambda\)SF-calculus