Separating weakening and contraction in a linear lambda calculus

MaRDI QIDQ4953356zbMATH OpenFDO

Authors J. Maraist

Publication date 6 December 2000

zbMATH Keywords

call-by-needconfluencelinear logicresource consumptionseparated-linear lambda calculussubject reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Weak linearization of the lambda calculus
• A linearization of the Lambda-calculus and consequences
• Combinatory weak reduction in lambda calculus
• A -calculus with explicit weakening and explicit substitution
• A Terminating and Confluent Linear Lambda Calculus
• Weakening the axiom of overlap in infinitary lambda calculus
• The Weak Normalization of the Simply Typed  se-calculus
• Linearization of the lambda-calculus and its relation with intersection type systems
• Refining reduction in the lambda calculus
• Term Rewriting and Applications

Cited in

(4)

• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Proof nets, garbage, and computations
• scientific article; zbMATH DE number 1231468 (Why is no real title available?)
• The weak lambda calculus as a reasonable machine

This page was built for publication: Separating weakening and contraction in a linear lambda calculus

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