Strong normalisation for applied lambda calculi
From MaRDI portal
Publication:5310640
DOI10.2168/LMCS-1(2:3)2005zbMath1125.03014OpenAlexW2113288428MaRDI QIDQ5310640
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-1(2:3)2005
Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)
Related Items (4)
The equivalence of bar recursion and open recursion ⋮ Constructive forcing, CPS translations and witness extraction in Interactive realizability ⋮ A domain model characterising strong normalisation ⋮ Unnamed Item
This page was built for publication: Strong normalisation for applied lambda calculi
