Strong normalisation for the linear term calculus

DOI10.1017/S0956796800001246MaRDI QIDQ4836022zbMATH OpenFDO

Authors P. N. Benton

Publication date 3 July 1995

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

lambda calculuslinear term calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Recommendations

• A Terminating and Confluent Linear Lambda Calculus
• Weak linearization of the lambda calculus
• scientific article; zbMATH DE number 4134006
• Logic Based Program Synthesis and Transformation
• Short Proofs of Strong Normalization

Cites work

• Intensional interpretations of functionals of finite type I

Cited in

(8)

• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• Natural deduction for intuitionistic linear logic
• Weak linearization of the lambda calculus
• Logic Based Program Synthesis and Transformation
• A Terminating and Confluent Linear Lambda Calculus
• Uniform strong normalization for multi-discipline calculi
• Strong normalization of barrecursive terms without using infinite terms
• Exponentials as substitutions and the cost of cut elimination in linear logic

This page was built for publication: Strong normalisation for the linear term calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836022)