Delayed Substitutions
From MaRDI portal
Publication:5432340
DOI10.1007/978-3-540-73449-9_14zbMath1203.68031OpenAlexW2912339902MaRDI QIDQ5432340
Publication date: 2 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_14
Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)
Related Items (7)
On explicit substitution with names ⋮ Characterising Strongly Normalising Intuitionistic Sequent Terms ⋮ A faithful and quantitative notion of distant reduction for generalized applications ⋮ A short proof that adding some permutation rules to \(\beta \) preserves SN ⋮ A note on preservation of strong normalisation in the \(\lambda \)-calculus ⋮ The \(\lambda \)-calculus and the unity of structural proof theory ⋮ Monadic Translation of Intuitionistic Sequent Calculus
This page was built for publication: Delayed Substitutions
