Inhabitation in typed lambda-calculi (A syntactic approach)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1210, Issue , 1997, Pages 373-389

  Urzyczyn, Paweł ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); SYNTACTICS;

HIGHER-ORDER; LAMBDA-CALCULI; PSPACE-COMPLETE; SECOND ORDERS; SIMPLY TYPED LAMBDA CALCULUS; SYNTACTIC APPROACH;

PATHOLOGY;

EID: 21744457624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_47     Document Type: Conference Paper

References (14)

1. Arts, T., Embedding first order predicate logic in second order propositional logic, Master Thesis, Katholieke Universiteit Nijmegen, 1992.
2. Arts, T., Dekkers, W., Embedding first order predicate logic in second order propositional logic, Technical report 93-02, Katholieke Universiteit Nijmegen, 1993.
3. Barendregt, H.P., Lambda calculi with types, chapter in: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T. Maibaum eds.), Oxford University Press, 1990, pp. 117-309.
4. Gabbay, D.M., On 2nd order intuitionistic propositional calculus with full comprehension, Arch. math. Logik, 16 (1974), 177-186.
5. Gabbay, D.M., Semantical Investigations in Heyting's Intuitionistic Logic, D. Reidel Publ. Co., 1981.
6. Girard, J.-Y., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press, Cambridge, 1989.
7. Leivant, D., Polymorphic type inference, Proc. 10-th ACM Symposium on Principles of Programming Languages, ACM, 1983.
8. LSb, M. H., Embedding first order predicate logic in fragments of intuitionistic logic, Journal Symb. Logic, 41, No. 4 (1976), 705-718.
9. Prawitz, D., Some results for intnitionistic logic with second order quantification rules, in: lntuitionism and Proof Theory (A. Kino, J. Myhill, R.E. Vesley eds.), North-Holland, Amsterdam, 1970, pp. 259-270.
10. Rasiowa, H., Sikorski, R., The Mathematics of Metamathematics, PWN, Warsaw, 1963.
11. Statman, R., Intuitionistic propositional logic is polynomial-space complete, Theoretical Computer Science 9, 67-72 (1979)
12. Urzyczyn, P., Type reconstruction in Fω, to appear in Mathematical Structures in Computer Science. Preliminary version in Proc. Typed Lambda Calculus and Applications (M. Bezem and J.F. Groote, eds.), LNCS 664, Springer-Verlag, Berlin, 1993, pp. 418-432.
13. Urzyczyn, P., The emptiness problem for intersection types, Proc. 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 300-309. (To appear in Journal of Symbolic Logic.)
14. Wells, J.B., Typability and type checking in the second-order λ-calculus calculus are equivalent and undecidable, Proc. 9th IEEE Symposium on Logic in Computer Science, 1994, pp. 176-185. (To appear in Annals of Pure and Applied Logic.)