A new characterization of lambda definability

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

Volumn 664 LNCS, Issue , 1993, Pages 245-257

  Jung, Achim ^a   Tiuryn, Jerzy ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

PATHOLOGY;

DECISION PROCEDURE; DEFINABILITY; LOGICAL RELATIONS; ORDERED SET;

BIOMINERALIZATION;

EID: 85028745708     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037110     Document Type: Conference Paper

References (13)

1. A. Jung and A. Stoughton. Studying the Fully Abstract Model of PCF within its Continuous Function Model. In this proceedings, 1993.
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, Intuitwmsm and Proof Theory, Proc. summer conference at Buffalo N. Y., 1968, pages 227-234. North-Holland, 1970.
3. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986.
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.
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 Syrup. on Logic in Computer Science, 1987, pages 303-314.
6. G. D. Plotkin. Lambda-Defmability and Logical Relations. Memorandum SAIRM-4, University of Edinburgh, October 1973.
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.
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.
9. R. Statman. Completeness, Invariance and λ-definabifity. Journal of Symbolic Logic, 47:17-26, 1982.
10. R. Statman. Embeddings, Homomorphisms and λ-definability. Manuscript, Rutgers University, 1982.
11. R. Statman. λ-definable Funtionals and βνConversion. Arch. Math. Logik, 23:21-26, 1983.
12. R. Statman. Logical Relations and the Typed λ-Calculus. Information and Control,65:85-97, 1985.
13. R. Statman and G. Dowek. On Statman’s Finite Completeness Theorem. Technical Report CMU-CS-92-152, Carnegie Mellon University, 1992.