Strong Normalization and Typability with Intersection Types
Notre Dame Journal of Formal Logic 37 (1):44-52 (1996)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMariangiola Dezani-Ciancaglini, Silvia Ghilezan & Betti Venneri (1997). The "Relevance" of Intersection and Union Types. Notre Dame Journal of Formal Logic 38 (2):246-269.
René David & Karim Nour (2003). A Short Proof of the Strong Normalization of Classical Natural Deduction with Disjunction. Journal of Symbolic Logic 68 (4):1277-1288.
Koji Nakazawa & Makoto Tatsuta (2003). Corrigendum to "Strong Normalization Proof with CPS-Translation for Second Order Classical Natural Deduction". Journal of Symbolic Logic 68 (4):1415-1416.
Koji Nakazawa & Makoto Tatsuta (2003). Strong Normalization Proof with CPS-Translation for Second Order Classical Natural Deduction. Journal of Symbolic Logic 68 (3):851-859.
M. W. Bunder (2002). A Classification of Intersection Type Systems. Journal of Symbolic Logic 67 (1):353-368.
Pawel Urzyczyn (1999). The Emptiness Problem for Intersection Types. Journal of Symbolic Logic 64 (3):1195-1215.
Motohiko Mouri & Norihiro Kamide (forthcoming). Strong Normalizability of Typed Lambda-Calculi for Substructural Logics. Logica Universalis.
A. S. Troelstra (1986). Strong Normalization for Typed Terms with Surjective Pairing. Notre Dame Journal of Formal Logic 27 (4):547-550.
Ralph Matthes (2002). Tarski's Fixed-Point Theorem and Lambda Calculi with Monotone Inductive Types. Synthese 133 (1-2):107 - 129.
Osamu Takaki (1997). Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction. Notre Dame Journal of Formal Logic 38 (3):350-373.
Xiaoping Chen (2011). Various Concepts of “Supervenience” and Their Relations: A Comment on Kim's Theory of Supervenience. Frontiers of Philosophy in China 6 (2):316-333.
Ulrich Berger, Stefan Berghofer, Pierre Letouzey & Helmut Schwichtenberg (2006). Program Extraction From Normalization Proofs. Studia Logica 82 (1):25 - 49.
Sachio Hirokawa, Yuichi Komori & Izumi Takeuti (1996). A Reduction Rule for Peirce Formula. Studia Logica 56 (3):419 - 426.
Tapani Hyttinen & Meeri Kesälä (2010). Lascar Types and Lascar Automorphisms in Abstract Elementary Classes. Notre Dame Journal of Formal Logic 52 (1):39-54.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
