Intersection and Union Types in the λ¯μμ˜-calculus | Zendy

Daniel J. Dougherty | Zendy; Silvia Ghilezan | Zendy; Pierre Lescanne | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Intersection and Union Types in the λ¯μμ˜-calculus

Author(s) -

Daniel J. Dougherty,

Silvia Ghilezan,

Pierre Lescanne

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.06.010

Subject(s) - intersection (aeronautics) , mathematics , type (biology) , sequent calculus , algorithm , discrete mathematics , calculus (dental) , mathematical proof , geometry , ecology , engineering , biology , aerospace engineering , medicine , dentistry

The original λ¯μμ˜ of Curien and Herbelin has a system of simple types, based on sequent calculus, embodying a Curry-Howard correspondence with classical logic. We introduce and discuss three type assignment systems that are extensions of λ¯μμ˜ with intersection and union types. The intrinsic symmetry in the λ¯μμ˜ calculus leads to an essential use of both intersection and union types

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research