{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171512},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014057","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:50:31Z","timestamp":1132732231000},"page":"249-265","source":"Crossref","is-referenced-by-count":13,"title":["Final semantics for untyped \u03bb-calculus"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky, L. Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, 105(2):159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"17_CR2","unstructured":"P. Aczel, Non-wellfounded sets, Number 14, Lecture Notes CSLI, 1988."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"P. Aczel, N. Mendler, A final coalgebra theorem Category Thepry and Computer Science Proceedings, D. Pitt et al. eds., Springer LNCS n.389:357\u2013365, 1989.","DOI":"10.1007\/BFb0018361"},{"key":"17_CR4","volume-title":"The Lambda Calculus, its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"H. Barendregt, The Lambda Calculus, its Syntax and Semantics, North Holland, Amsterdam, 1984."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"M. Coppo, M. Dezani-Ciancaglini, M. Zacchi, Type Theories, Normal Forms and D \u221e-Lambda-Models, Information and Computation, 72(2):85\u2013116, 1987.","journal-title":"Information and Computation"},{"issue":"2","key":"17_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"L. Egidi, F. Honsell, S. Ronchi Della Rocca, Operational, denotational and logical Descriptions: a Case Study, Fundamenta Informaticae, 16(2):149\u2013169, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"M. Fiore, A Coinduction Principle for Recursive Data Types Based on Bisimulation, 8th LICS Conference Proceedings, IEEE Computer Society Press:110\u2013119, 1993.","DOI":"10.1109\/LICS.1993.287595"},{"key":"17_CR8","first-page":"493","volume":"10","author":"M. Forti","year":"1983","unstructured":"M. Forti, F. Honsell, Set Theory with Free Construction Principles, Annali Scuola Normale Sup. Pisa, Cl. Sci., (IV), 10:493\u2013522, 1983.","journal-title":"Annali Scuola Normale Sup. Pisa, Cl. Sci., (IV)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"M. Forti, F. Honsell, M. Lenisa, Processes and Hyperuniverses, MFCS'94 Conference Proceedings, I. Privara et al. eds., Springer LNCS n.841:352\u2013363, 1994.","DOI":"10.1007\/3-540-58338-6_82"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"F. Honsell, M. Lenisa, Some Results on Restricted \u03bb-calculi, MFCS'93 Conference Proceedings, A. Borzyszkowski et al. eds., Springer LNCS n.711:84\u2013104, 1993.","DOI":"10.1007\/3-540-57182-5_6"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"1","author":"F. Honsell","year":"1992","unstructured":"F. Honsell, S. Ronchi Della Rocca, An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, J. of Computer and System Sciences (45) 1:49\u201375, 1992.","journal-title":"J. of Computer and System Sciences (45)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"R. Milner, Operational and Algebraic Semantics of Concurrent Processes, Handbook of Theoretical Computer Science, Ch.19, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"17_CR13","unstructured":"C.H.L. Ong, The lazy lambda calculus: an investigation into the foundations of functional programming, Ph.D. thesis, Imperial College of Science and Technology, University of London, 1988."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"A.M. Pitts, Relational Properties of Recursively Defined Domains, 8th LICS Conference Proceedings, IEEE Computer Society Press:86\u201397, 1993.","DOI":"10.1109\/LICS.1993.287597"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin, Call-by-name, Call-by-value and the \u03bb-calculus, Theoretical Computer Science (1):125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"17_CR16","unstructured":"S. Ronchi Della Rocca, International Summer School in Logic for Computer Science, Chambery 28\/6-9\/7 1993, lecture notes."},{"issue":"3","key":"17_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1017\/S096012950000147X","volume":"2","author":"J.J.M.M. Rutten","year":"1992","unstructured":"J.J.M.M. Rutten, Processes as terms: non-wellfounded models for bisimulation, Math.Struct.Comp.Sci., 2(3):257\u2013275, 1992.","journal-title":"Math.Struct.Comp.Sci."},{"key":"17_CR18","unstructured":"J.J.M.M. Rutten, D. Turi, On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders, REX Conference Proceedings, J. de Bakker et al. eds., Springer LNCS n.666:477\u2013530, 1993."},{"key":"17_CR19","unstructured":"D. Turi, B. Jacobs, On final Semantics for applicative and non-deterministic languages, Fifth Biennial Meeting on Category Theory and Computer Science, Amsterdam, 1993."},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C.P. Wadsworth","year":"1976","unstructured":"C.P. Wadsworth, The relation between computational and denotational properties for Scott's D \u221e-models of the \u03bb-calculus, SIAM J. of Computing, 5(3):488\u2013521, 1976.","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T07:33:55Z","timestamp":1626766435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0014057","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}