Weak linearization of the lambda calculus
From MaRDI portal
Recommendations
Cites work
- A linearization of the Lambda-calculus and consequences
- A Machine-Oriented Logic Based on the Resolution Principle
- An extension of basic functionality theory for -calculus
- BCK-combinators and linear \(\lambda\)-terms have types
- Computational interpretations of linear logic
- scientific article; zbMATH DE number 1231468 (Why is no real title available?)
- scientific article; zbMATH DE number 512773 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- Linear logic
- Linearization of the lambda-calculus and its relation with intersection type systems
- Logic Based Program Synthesis and Transformation
- Paths, computations and labels in the \(\lambda\)-calculus
- Perpetual reductions in -calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Principal Type-Scheme of an Object in Combinatory Logic
Cited in
(12)- Non-linear rewrite closure and weak normalization
- A Terminating and Confluent Linear Lambda Calculus
- The Power of Linear Functions
- A linearization of the Lambda-calculus and consequences
- Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
- Strong normalisation for the linear term calculus
- scientific article; zbMATH DE number 1444323 (Why is no real title available?)
- Logic Based Program Synthesis and Transformation
- Structural rules and algebraic properties of intersection types
- Quantitative weak linearisation
- The weak lambda calculus as a reasonable machine
- Gödel's system T revisited
This page was built for publication: Weak linearization of the lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566028)