The "Relevance" of Intersection and Union Types

Notre Dame Journal of Formal Logic 38 (2):246-269 (1997)
  Copy   BIBTEX

Abstract

The aim of this paper is to investigate a Curry-Howard interpretation of the intersection and union type inference system for Combinatory Logic. Types are interpreted as formulas of a Hilbert-style logic L, which turns out to be an extension of the intuitionistic logic with respect to provable disjunctive formulas (because of new equivalence relations on formulas), while the implicational-conjunctive fragment of L is still a fragment of intuitionistic logic. Moreover, typable terms are translated in a typed version, so that --typed combinatory logic terms are proved to completely codify the associated logical proofs

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-08-24

Downloads
8 (#1,345,183)

6 months
39 (#100,216)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The emptiness problem for intersection types.Paweł Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.

Add more citations

References found in this work

A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
The semantics of entailment — III.Richard Routley & Robert K. Meyer - 1972 - Journal of Philosophical Logic 1 (2):192 - 208.
Algebraic analysis of entailment I.Robert K. Meyer & Richard Routley - 1972 - Logique Et Analyse 15 (59/60):407-428.
Concerning formulas of the types a →b ∨c, a →(ex)b(X).Ronald Harrop - 1960 - Journal of Symbolic Logic 25 (1):27-32.
Domain theory in logical form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.

View all 10 references / Add more references