Spinal atomic \(\lambda\)-calculus

DOI10.1007/978-3-030-45231-5_30zbMath1496.03065OpenAlexW3016802302MaRDI QIDQ2200851

David Sherratt, Willem Heijltjes, Tom Gundersen, Michel Parigot

Publication date: 23 September 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-45231-5_30

zbMATH Keywords

\(\lambda\)-calculusdeep inferenceCurry-Howardfull laziness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (2)

Node Replication: Theory And Practice ⋮ The spirit of node replication

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly distributive categories
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lambda-calculus with director strings
• Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
• A unified approach to fully lazy sharing
• A Local System for Classical Logic
• A consistent extension of the lambda-calculus as a base for functional programming languages
• Director strings as combinators
• Symmetric normalisation for intuitionistic logic
• Explicit substitutions
• Weak optimality, and the meaning of sharing
• Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing
• A Local System for Intuitionistic Logic
• A Proof Calculus Which Reduces Syntactic Bureaucracy
• An Algorithmic Interpretation of a Deep Inference System
• Some Properties of Conversion
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Automated Deduction – CADE-19

This page was built for publication: Spinal atomic \(\lambda\)-calculus