Inhabitation in Typed Lambda-Calculi (A Syntactic Approach)
نویسنده
چکیده
Abst rac t . 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~).
منابع مشابه
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search
A new, comprehensive approach to inhabitation problems in simply-typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given inhabitation problem, which is in terms of a lambda-calculus for proof search that the authors developed recently. The representation may be seen as extending...
متن کاملA short note on type-inhabitation: Formula-trees vs. game semantics
This short note compares two different methods for exploring type-inhabitation in the simply typed lambda-calculus, highlighting their similarities.
متن کاملTicket Entailment is decidable
We prove the decidability of the logic T→ of Ticket Entailment. Raised by Anderson and Belnap within the framework of relevance logic, this question is equivalent to the question of the decidability of type inhabitation in simply-typed combinatory logic with the partial basis BBIW. We solve the equivalent problem of type inhabitation for the restriction of simply-typed lambda-calculus to heredi...
متن کاملLabeling techniques and typed fixed-point operators
Labeling techniques for untyped lambda calculus were developed by Lévy, Hyland, Wadsworth and others in the 1970’s. A typical application is the proof of confluence from finiteness of developments: by labeling each subterm with a natural number indicating the maximum number of times this term may participate in a reduction step, we obtain a strongly-normalizing approximation of β, η -reduction....
متن کاملMixin Composition Synthesis Based on Intersection Types
We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are used to assign meaningful types to these terms without resorting to recursive types. Second, typed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997