论文信息 - Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)

Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)

A type is inhabited (non-empty) in a typed calculus iff there is a closed term of this type. The inhabitation (emptiness) problem is to determine if a given type is inhabited. This paper provides direct, purely syntactic proofs of the following results: the inhabitation problem is PSPACE-complete for simply typed lambda-calculus and undecidable for the polymorphic second-order and higher-order lambda calculi (systems F and Fω).

Pawel Urzyczyn | P. Urzyczyn

[1] Pawel Urzyczyn. Type reconstruction in F-omega is undecidable , 1993, TLCA.

[2] Thomas Arts,et al. Embedding First Order Predicate Logic in Second Order Propositional Logic , 1992 .

[3] D. Gabbay. Semantical investigations in Heyting's intuitionistic logic , 1981 .

[4] M. H. Lob,et al. Embedding First Order Predicate Logic in Fragments of Intuitionistic Logic , 1976, J. Symb. Log..

[5] R. Sikorski,et al. The mathematics of metamathematics , 1963 .

[6] Richard Statman,et al. Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..

[7] Pawel Urzyczyn. The Emptiness Problem for Intersection Types , 1999, J. Symb. Log..

[8] Akiko Kino,et al. Intuitionism and Proof Theory , 1970 .

[9] Daniel Leivant,et al. Polymorphic type inference , 1983, POPL '83.

[10] D. Gabbay. On 2nd order intuitionistic propositional calculus with full comprehension , 1974 .

[11] Dag Prawitz,et al. Some Results for Intuitionistic Logic with Second Order Quantification Rules , 1970 .

[12] J. Girard,et al. Proofs and types , 1989 .

[13] J. B. Wells,et al. Typability and type checking in the second-order /spl lambda/-calculus are equivalent and undecidable , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.