Advertisement

A new characterization of lambda definability

  • Achim Jung
  • Jerzy Tiuryn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 664)

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.

Keywords

Normal Form Induction Hypothesis Free Variable Fundamental Theorem Logical Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Jung and A. Stoughton. Studying the Fully Abstract Model of PCF within its Continuous Function Model. In this proceedings, 1993.Google Scholar
  2. 2.
    H. Läuchli. An Abstract Notion of Realizability for which Intuitionistic Predicate Calculus is Complete. In A. Kino, J. Myhill, and R. E. Vesley, editors, Intuitionism and Proof Theory, Proc. summer conference at Buffalo N. Y., 1968, pages 227–234. North-Holland, 1970.Google Scholar
  3. 3.
    J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986.Google Scholar
  4. 4.
    J. C. Mitchell. Type Systems for Programming Languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458. North Holland, 1990.Google Scholar
  5. 5.
    J.C. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic, 51:99–124, 1991. Preliminary version in Proc. IEEE Symp. on Logic in Computer Science, 1987, pages 303–314.Google Scholar
  6. 6.
    G. D. Plotkin. Lambda-Definability and Logical Relations. Memorandum SAI-RM-4, University of Edinburgh, October 1973.Google Scholar
  7. 7.
    G. D. Plotkin. Lambda-Definability in the Full Type Hierarchy. In Jonathan P. Seldin and J. Roger Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363–373. Academic Press, London, 1980.Google Scholar
  8. 8.
    K. Sieber. Reasoning about Sequential Functions via Logical Relations. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, editors, Proc. LMS Symposium on Applications of Categories in Computer Science, Durham 1991, volume 177 of LMS Lecture Note Series, pages 258–269. Cambridge University Press, 1992.Google Scholar
  9. 9.
    R. Statman. Completeness, Invariance and λ-definability. Journal of Symbolic Logic, 47:17–26, 1982.Google Scholar
  10. 10.
    R. Statman. Embeddings, Homomorphisms and λ-definability. Manuscript, Rutgers University, 1982.Google Scholar
  11. 11.
    R. Statman. λ-definable Functionals and βη Conversion. Arch. Math. Logik, 23:21–26, 1983.Google Scholar
  12. 12.
    R. Statman. Logical Relations and the Typed λ-Calculus. Information and Control, 65:85–97, 1985.Google Scholar
  13. 13.
    R. Statman and G. Dowek. On Statman's Finite Completeness Theorem. Technical Report CMU-CS-92-152, Carnegie Mellon University, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Achim Jung
    • 1
  • Jerzy Tiuryn
    • 2
  1. 1.Fachbereich MathematikTechnische Hochschule DarmstadtDarmstadtGermany
  2. 2.Instytut InformatykiUniwersytet WarszawskiWarszawaPoland

Personalised recommendations