Linearization of the lambda-calculus and its relation with intersection type systems
From MaRDI portal
Publication:5692152
Recommendations
- A linearization of the Lambda-calculus and consequences
- Intersection typed \(\lambda \)-calculus
- Strict intersection types for the lambda calculus
- Intersection types for light affine lambda calculus
- A typed lambda calculus with intersection types
- Non-idempotent intersection types for the lambda-calculus
- Intersection types for the \(\lambda\mu\)-calculus
- Full intersection types and topologies in lambda calculus
- A type system for the vectorial aspect of the linear-algebraic lambda-calculus
- Intersection types for lambda-terms and combinators and their logics
Cited in
(16)- Intersection types for light affine lambda calculus
- Strict intersection types for the lambda calculus
- Quantitative weak linearisation
- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus
- Execution time of λ-terms via denotational semantics and intersection types
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- Quantitative types for the linear substitution calculus
- Collapsing non-idempotent intersection types
- The algebra of expansion
- Structural rules and algebraic properties of intersection types
- Type inference for rank-2 intersection types using set unification
- Logic Based Program Synthesis and Transformation
- A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables
- Strong normalization through intersection types and memory
- Weak linearization of the lambda calculus
- scientific article; zbMATH DE number 1444323 (Why is no real title available?)
This page was built for publication: Linearization of the lambda-calculus and its relation with intersection type systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692152)
