Structural rules and algebraic properties of intersection types
From MaRDI portal
Publication:6164466
DOI10.1007/978-3-031-17715-6_6arXiv2204.12376OpenAlexW4312605165MaRDI QIDQ6164466
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12376
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Combinatory logic. With two sections by William Craig.
- Uniformity and the Taylor expansion of ordinary lambda-terms
- An extension of basic functionality theory for \(\lambda\)-calculus
- Weak linearization of the lambda calculus
- From Polyvariant flow information to intersection and union types
- Example-directed synthesis: a type-theoretic interpretation
- An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
- The Mathematics of Sentence Structure
- A filter lambda model and the completeness of type assignment
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- Functional Characters of Solvable Terms
- A linearization of the Lambda-calculus and consequences
- Non-idempotent intersection types for the Lambda-Calculus
- Functionality in Combinatory Logic
- A tale of intersection types
- Elaborating intersection and union types
- Types, potency, and idempotency
- Linearization of the lambda-calculus and its relation with intersection type systems
- Structural rules and algebraic properties of intersection types
This page was built for publication: Structural rules and algebraic properties of intersection types