Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
From MaRDI portal
Publication:2881096
DOI10.2168/LMCS-8(1:28)2012zbMath1237.03011arXiv1203.0670MaRDI QIDQ2881096
Beniamino Accattoli, Delia Kesner
Publication date: 3 April 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.0670
Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (5)
Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ Non-linearity as the Metric Completion of Linearity ⋮ Spinal atomic \(\lambda\)-calculus ⋮ Unnamed Item ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
Uses Software
This page was built for publication: Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
