{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:28:54Z","timestamp":1765294134767},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540565175"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0037110","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:21:36Z","timestamp":1138202496000},"page":"245-257","source":"Crossref","is-referenced-by-count":34,"title":["A new characterization of lambda definability"],"prefix":"10.1007","author":[{"given":"Achim","family":"Jung","sequence":"first","affiliation":[]},{"given":"Jerzy","family":"Tiuryn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"A. Jung and A. Stoughton. Studying the Fully Abstract Model of PCF within its Continuous Function Model. In this proceedings, 1993.","DOI":"10.1007\/BFb0037109"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"H. L\u00e4uchli. 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\u2013234. North-Holland, 1970.","DOI":"10.1016\/S0049-237X(08)70754-7"},{"key":"17_CR3","unstructured":"J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"J. C. Mitchell. Type Systems for Programming Languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365\u2013458. North Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0168-0072(91)90067-V","volume":"51","author":"J.C. Mitchell","year":"1991","unstructured":"J.C. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic, 51:99\u2013124, 1991. Preliminary version in Proc. IEEE Symp. on Logic in Computer Science, 1987, pages 303\u2013314.","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR6","unstructured":"G. D. Plotkin. Lambda-Definability and Logical Relations. Memorandum SAI-RM-4, University of Edinburgh, October 1973."},{"key":"17_CR7","first-page":"363","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"G. D. Plotkin","year":"1980","unstructured":"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\u2013373. Academic Press, London, 1980."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013269. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511525902.015"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R. Statman","year":"1982","unstructured":"R. Statman. Completeness, Invariance and \u03bb-definability. Journal of Symbolic Logic, 47:17\u201326, 1982.","journal-title":"Journal of Symbolic Logic"},{"key":"17_CR10","unstructured":"R. Statman. Embeddings, Homomorphisms and \u03bb-definability. Manuscript, Rutgers University, 1982."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02023009","volume":"23","author":"R. Statman","year":"1983","unstructured":"R. Statman. \u03bb-definable Functionals and \u03b2\u03b7 Conversion. Arch. Math. Logik, 23:21\u201326, 1983.","journal-title":"Arch. Math. Logik"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0019-9958(85)80001-2","volume":"65","author":"R. Statman","year":"1985","unstructured":"R. Statman. Logical Relations and the Typed \u03bb-Calculus. Information and Control, 65:85\u201397, 1985.","journal-title":"Information and Control"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"R. Statman and G. Dowek. On Statman's Finite Completeness Theorem. Technical Report CMU-CS-92-152, Carnegie Mellon University, 1992.","DOI":"10.21236\/ADA256233"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:22:04Z","timestamp":1607552524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540565175"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0037110","relation":{},"subject":[]}}