Authors: Ghilezan, Silvia 
Lescanne, Pierre
Title: Classical Proofs, Typed Processes, and Intersection Types Extended Abstract
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 3085
First page: 226
Last page: 241
Conference: International Workshop on Types for Proofs and Programs, TYPES 2003
Issue Date: 1-Dec-2004
Rank: M22
ISBN: 978-3-540-22164-7
ISSN: 0302-9743
DOI: 10.1007/978-3-540-24849-1_15
Curien and Herbelin provided a Curry and Howard correspondence between classical prepositional logic and a computational model called λ̄μμμ which is a calculus for interpreting classical sequents. A new terminology for λ̄μμ̄ in terms of pairs of callers-callees which we name capsules enlightens a natural link between λ̄μμ̄ and process calculi. In this paper we propose an intersection type system λ̄μμ̄ which is an extension of λ̄μμ̄ with intersection types. We prove that all strongly normalizing λ̄μμ̄-terms are typeable in the new system, which was not the case in λ̄μμ̃. Also, we prove that all typeable μ̃-free terms are strongly normalizing.
Publisher: Springer Link

Show full item record


checked on May 22, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.