Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14047
Title: | Reducibility: A ubiquitous method in lambda calculus with intersection types | Authors: | Gilezan, Silvia Likavec S. |
Issue Date: | 1-Feb-2003 | Journal: | Electronic Notes in Theoretical Computer Science | Abstract: | A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type Ω. Sufficient conditions for its application are derived. This method leads to uniform proofs of confluence, standardization, weak head normalization of terms typeable in the system with the universal type Ω. The method extends Tait's reducibility method for the proof of strong normalization of the simply typed lambda calculus, Krivine's extension of the same method for the strong normalization of intersection type system without Ω, and Statman-Mitchell's logical relation method for the proof of confluence of β-η-reduction on the simply typed lambda terms. As a consequence, the confluence and the standardization of all (untyped) lambda terms is obtained. © 2002 Published by Elsevier Science B.V. | URI: | https://open.uns.ac.rs/handle/123456789/14047 | ISSN: | 15710661 | DOI: | 10.1016/S1571-0661(04)80493-6 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
2
checked on Sep 9, 2023
Page view(s)
65
Last Week
18
18
Last month
2
2
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.