A Filter lambda model and the completeness of type assignment
Journal of Symbolic Logic 48 (4):931-940 (1983)
| 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,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesA. R. D. Mathias (2001). Slim Models of Zermelo Set Theory. Journal of Symbolic Logic 66 (2):487-496.
H. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
M. W. Bunder (2002). A Classification of Intersection Type Systems. Journal of Symbolic Logic 67 (1):353-368.
Beihai Zhou (1999). Grafted Frames and S1-Completeness. Journal of Symbolic Logic 64 (3):1324-1338.
J. G. Raftery (2011). Contextual Deduction Theorems. Studia Logica 99 (1-3):279-319.
William J. Mitchell (2003). A Gitik Iteration with Nearly Easton Factoring. Journal of Symbolic Logic 68 (2):481-502.
M. Coppo & M. Dezani-Ciancaglini (1980). An Extension of the Basic Functionality Theory for the $\Lambda$-Calculus. Notre Dame Journal of Formal Logic 21 (4):685-693.
Pawel Urzyczyn (1999). The Emptiness Problem for Intersection Types. Journal of Symbolic Logic 64 (3):1195-1215.
Sachio Hirokawa (1992). The Converse Principal Type-Scheme Theorem in Lambda Calculus. Studia Logica 51 (1):83 - 95.
Juliette Kennedy & Saharon Shelah (2002). On Regular Reduced Products. Journal of Symbolic Logic 67 (3):1169-1177.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,501 of 549,088 )Recent downloads (6 months)1 ( #63,317 of 549,088 )How can I increase my downloads? |
My notes
Discussion
