Intensional computation with higher-order functions

DOI10.1016/J.TCS.2019.02.016zbMath1417.68041OpenAlexW2915506276WikidataQ128319672 ScholiaQ128319672MaRDI QIDQ1733061

C. Barry Jay

Publication date: 26 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.02.016

zbMATH Keywords

higher-order functionsfoundations of computationintensional computationSF-calculus

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) General topics in the theory of computing (68Q01)

Uses Software

• MiniML
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conflicting accounts of \(\lambda\)-definability
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A theory of type polymorphism in programming
• A combinatory account of internal structure
• A modal analysis of staged computation
• The Theory of Calculi with Explicit Substitutions Revisited
• First-class patterns
• Pattern Calculus
• Term Rewriting and All That
• Introduction to generalized type systems
• Typed self-interpretation by pattern matching
• Typed self-evaluation via intensional type functions
• The next 700 programming languages
• An Unsolvable Problem of Elementary Number Theory
• Programming Languages and Systems
• Linear-time self-interpretation of the pure lambda calculus

This page was built for publication: Intensional computation with higher-order functions