A Terminating and Confluent Linear Lambda Calculus
From MaRDI portal
Recommendations
Cited in
(21)- scientific article; zbMATH DE number 176742 (Why is no real title available?)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- scientific article; zbMATH DE number 1223626 (Why is no real title available?)
- A Linear Spine Calculus
- scientific article; zbMATH DE number 7243672 (Why is no real title available?)
- Weak linearization of the lambda calculus
- Logic Based Program Synthesis and Transformation
- Confluence via strong normalisation in an algebraic -calculus with rewriting
- A mixed -calculus
- Coherence by normalization for linear multicategorical structures
- 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
- scientific article; zbMATH DE number 1444323 (Why is no real title available?)
- A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Term Rewriting and Applications
- Axioms for the Theory of Lambda-Conversion
- Strong normalisation for the linear term calculus
- Resource operators for \(\lambda\)-calculus
- A classical linear \(\lambda\)-calculus
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
This page was built for publication: A Terminating and Confluent Linear Lambda Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527292)
