{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T03:03:20Z","timestamp":1790737400534,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540571827","type":"print"},{"value":"9783540479277","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:11:41Z","timestamp":1330240301000},"page":"84-104","source":"Crossref","is-referenced-by-count":7,"title":["Some results on the full abstraction problem for restricted lambda calculi"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"6_CR1","volume-title":"The Lambda, Calculus, its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda, Calculus, its Syntax and Semantics. North Holland. Amsterdam (1984)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C.: Lambda Calculus and Computer Science Theory. LNCS 37 Springer-Verlag (1975)","DOI":"10.1007\/BFb0029515"},{"key":"6_CR3","volume-title":"The Calculi of Lambda Conversion","author":"A. Church","year":"1941","unstructured":"Church, A.: The Calculi of Lambda Conversion. Princeton University Press Princeton (1941)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Zacchi, M.: Type Theories, Normal Forms and D \u221e-Lambda-Models. Information and Computation 72(2) (1987) 85\u2013116","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR5","first-page":"399","volume":"51","author":"M. Dezani-Ciancaglini","year":"1986","unstructured":"Dezani-Ciancaglini, M., Honsell, F., Ronchi Della Rocca, S.: Models for theories of functions depending on all their arguments (abstract). Journal of Symbolic Logic 51(3) (1986) 399\u2013402","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"6_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"Egidi, L., Honsell, F., Ronchi Della Rocca, S.: Operational, Denotational and Logical descriptions: a case study. Fundamenta Informaticae 16(2) (1992) 149\u2013169","journal-title":"Fundamenta Informaticae"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","volume":"45","author":"J. Y. Girard","year":"1986","unstructured":"Girard, J.Y.: The system F of variable types, fifteen years later. TCS 45 (1986) 159\u2013192","journal-title":"TCS"},{"key":"6_CR8","volume-title":"Proofs and Types","author":"J. Y. Girard","year":"1989","unstructured":"Girard, J. Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press. Cambridge (1989)"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","volume":"26","author":"J. R. Hindley","year":"1980","unstructured":"Hindley, J. R., Longo, G.: Lambda Calculus Models and Extensionality. Z. Math. Logik Grundlag. Math. 26 (1980) 289\u2013310","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"4","key":"6_CR10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"Landin, P. J.: The mechanical evaluation of expressions. Computer J. 6(4) (1964) 308\u2013320","journal-title":"Computer J."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A. Meyer","year":"1982","unstructured":"Meyer, A.: What is a, Model of the Lambda Calculus? Information and Control 52 (1982) 87\u2013122","journal-title":"Information and Control"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"Plotkin, G. D.: Call-by-name, call-by-value and the \u03bb-calculus. TCS 1 (1975) 125\u2013159","journal-title":"TCS"},{"issue":"5","key":"6_CR13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. B. Smith","year":"1982","unstructured":"Smith, M. B., Plotkin, G. D.: The category-theoretic solution of recursive domain equations. SIAM J. of Computing 11(5) (1982) 761\u2013783","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:14:44Z","timestamp":1640909684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}