Intersection Types as Logical Formulae

DOI10.1093/logcom/4.2.109zbMath0798.03013OpenAlexW2010274553MaRDI QIDQ4291035

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

zbMATH Keywords

lambda calculusintersection typescombinatory logictype assignment

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (13)

A classification of intersection type systems ⋮ The ``relevance of intersection and union types ⋮ A binary modal logic for the intersection types of lambda-calculus. ⋮ The semantics of entailment omega ⋮ A typed lambda calculus with intersection types ⋮ Finite Combinatory Logic with Intersection Types ⋮ Hyperformulae, Parallel Deductions and Intersection Types ⋮ Unnamed Item ⋮ The emptiness problem for intersection types ⋮ Unnamed Item ⋮ Inhabitation of Low-Rank Intersection Types ⋮ The Relevance of Semantic Subtyping ⋮ Intersection Typed λ-calculus

This page was built for publication: Intersection Types as Logical Formulae