1
by Achim Jung, Jerzy Tiuryn
http://www.tcs.informatik.uni-muenchen.de/lehre/WS99-00/LKT-SEM/Papers/JungTiuryn93.ps
Add To MetaCart
Abstract:
Abstract. We give a new characterization of lambda definability in Henkin models using logical relations defined over ordered sets with varying arity. The advantage of this over earlier approaches by Plotkin and Statman is its simplicity and universality. Yet, decidability of lambda definability for hereditarily finite Henkin models remains an open problem. But if the variable set allowed in terms is also restricted to be finite then our techniques lead to a decision procedure. 1
Citations
| 302 | Introduction to Higher Order Categorical Logic – Lambek, Scott - 1986 |
| 148 | Type systems for programming languages – Mitchell - 1990 |
| 52 | Lambda Definability in the Full Type Hierarchy – Plotkin - 1980 |
| 49 | Kripke-style models for typed lambda calculus – Mitchell, Moggi - 1991 |
| 35 | Logical relations and the typed -calculus – Statman - 1985 |
| 30 | Reasoning about Sequential Functions via Logical Relations – Sieber - 1992 |
| 20 | Studying the fully abstract model of PCF within its continuous function model – Jung, Stoughton - 1993 |
| 16 | An abstract notion of realizability for which intuitionistic predicate calculus is complete – Lauchli - 1970 |
| 13 | Completeness, invariance and -definability – Statman - 1982 |
| 12 | Lambda-definability and logical relations – Plotkin - 1973 |
| 9 | definable functionals and fij-conversion – Statman - 1983 |
| 4 | On statman's finite completeness theorem – Statman, Dowek - 1992 |
| 2 | Embeddings, Homomorphisms and -definability – Statman - 1982 |
