Skip to Main content Skip to Navigation
Conference papers

A Realizability Interpretation for Intersection and Union Types

Abstract : Proof-functional logical connectives allow reasoning about the structure of logical proofs, in this way giving to the latter the status of first-class objects. This is in contrast to classical truth-functional con- nectives where the meaning of a compound formula is dependent only on the truth value of its subformulas. In this paper we present a typed lambda calculus, enriched with strong products, strong sums, and a related proof-functional logic. This cal- culus, directly derived from a typed calculus previously defined by two of the current authors, has been proved isomorphic to the well-known Barbanera-Dezani-Ciancaglini-de’Liguoro type assignment system. We present a logic L∩∪ featuring two proof-functional connectives, namely strong conjunction and strong disjunction. We prove the typed calculus to be isomorphic to the logic L∩∪ and we give a realizability semantics using Mints’ realizers [Min89] and a completeness theorem. A prototype implementation is also described.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01317213
Contributor : Luigi Liquori <>
Submitted on : Friday, September 9, 2016 - 11:38:57 AM
Last modification on : Thursday, December 10, 2020 - 10:59:37 AM
Long-term archiving on: : Saturday, December 10, 2016 - 12:55:32 PM

File

0-paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01317213, version 2

Collections

Citation

Daniel J. Dougherty, Ugo de 'Liguoro, Luigi Liquori, Claude Stolze. A Realizability Interpretation for Intersection and Union Types. 14th Asian Symposium on Programming Languages and Systems, Nov 2016, Hanoi, Vietnam. ⟨hal-01317213v2⟩

Share

Metrics

Record views

525

Files downloads

389