Intersection Types as Logical Formulae
From MaRDI portal
Publication:4291035
DOI10.1093/LOGCOM/4.2.109zbMATH Open0798.03013OpenAlexW2010274553MaRDI QIDQ4291035FDOQ4291035
Authors: Betti Venneri
Publication date: 3 November 1994
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bb00621d5dacb2da63b229e0f5fc3f059cdffc08
Recommendations
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)
Cited In (20)
- The emptiness problem for intersection types
- Title not available (Why is that?)
- Intersection logic in sequent calculus style
- Intersection typed \(\lambda \)-calculus
- The relevance of semantic subtyping
- Intersection types from a proof-theoretic perspective
- A binary modal logic for the intersection types of lambda-calculus.
- Finite combinatory logic with intersection types
- Inhabitation of Low-Rank Intersection Types
- A classification of intersection type systems
- The semantics of entailment omega
- Intersection types for lambda-terms and combinators and their logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A typed lambda calculus with intersection types
- Intersection types for combinatory logic
- The ``relevance of intersection and union types
- Kripke semantics for intersection formulas
- Hyperformulae, parallel deductions and intersection types
This page was built for publication: Intersection Types as Logical Formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291035)