Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/11210
Назив: | Classical Proofs, Typed Processes, and Intersection Types Extended Abstract | Аутори: | Gilezan, Silvia Lescanne P. |
Датум издавања: | 1-дец-2004 | Часопис: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Сажетак: | 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. © Springer-Verlag 2004. | URI: | https://open.uns.ac.rs/handle/123456789/11210 | ISSN: | 3029743 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
Преглед/и станица
87
Протекла недеља
28
28
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.