lambda!-calculus, Intersection Types, and Involutions
From MaRDI portal
Publication:5089015
Recommendations
Cites work
- scientific article; zbMATH DE number 4179372 (Why is no real title available?)
- scientific article; zbMATH DE number 786500 (Why is no real title available?)
- A filter lambda model and the completeness of type assignment
- A structural approach to reversible computation
- A type assignment system for game semantics
- Games and full completeness for multiplicative linear logic
- Geometry of Interaction and linear combinatory algebras
- Innocent game semantics via intersection type assignment systems
- Linear realizability and full completeness for typed lambda-calculi
- Reversible combinatory logic
- Term Rewriting and Applications
- The geometry of types
- The involutions-as-principal types/application-as-unification analogy
- Unique decomposition categories, Geometry of Interaction and combinatory logic
This page was built for publication: lambda!-calculus, Intersection Types, and Involutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089015)