A Terminating and Confluent Linear Lambda Calculus

DOI10.1007/11805618_13zbMath1151.03321OpenAlexW60269903MaRDI QIDQ3527292

Masahito Hasegawa, Yo Ohta

Publication date: 25 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11805618_13

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Resource operators for \(\lambda\)-calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ A short proof that adding some permutation rules to \(\beta \) preserves SN ⋮ Unnamed Item ⋮ A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4

This page was built for publication: A Terminating and Confluent Linear Lambda Calculus