{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:21Z","timestamp":1761611301012},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626886"},{"type":"electronic","value":"9783540684381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62688-3_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:48:54Z","timestamp":1330296534000},"page":"248-266","source":"Crossref","is-referenced-by-count":2,"title":["Semantic techniques for deriving coinductive characterizations of observational equivalences for \u03bb-calculi"],"prefix":"10.1007","author":[{"given":"Marina","family":"Lenisa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"crossref","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":"16_CR2","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":"4","key":"16_CR3","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J.Symbolic Logic, 48(4):931\u2013940, 1983.","journal-title":"J.Symbolic Logic"},{"issue":"2","key":"16_CR4","doi-asserted-by":"crossref","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":"16_CR5","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, Rundamenta Informaticae, 16(2):149\u2013169, 1992.","journal-title":"Rundamenta Informaticae"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"P. Freyd, Algebraically complete categories, A.Carboni et al. eds, Category Theory '90 Springer LNM, 1488:95\u2013104, Como, 1990.","DOI":"10.1007\/BFb0084215"},{"key":"16_CR7","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, 711:84\u2013104, 1993.","DOI":"10.1007\/3-540-57182-5_6"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"F. Honsell, M. Lenisa, Final Semantics for untyped \u03bb-calculus, M.Dezani et al. eds, TLCA'95 Springer LNCS, 902:249\u2013265, Edinburgh, 1995.","DOI":"10.1007\/BFb0014057"},{"key":"16_CR9","unstructured":"F. Honsell, M. Lenisa, A Semantical Analysis of an Effective Perpetual Strategy, Draft, November 1996."},{"issue":"1","key":"16_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","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"},{"issue":"2","key":"16_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. Howe","year":"1996","unstructured":"D. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, 124(2):103\u2013112, 1996.","journal-title":"Information and Computation"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"M. Hyland, A survey of some useful partial order relations on terms of the lambdacalculus, C.B\u00f6hm ed., Springer LNCS, 37:83\u201395, 1975.","DOI":"10.1007\/BFb0029520"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"M. Lenisa, Final Semantics for a Higher Order Concurrent Language, CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS, 1059:102\u2013118, 1996.","DOI":"10.1007\/3-540-61064-2_32"},{"key":"16_CR14","unstructured":"M. Lenisa, The Congruence Candidate Method for Giving Coinductive Characterizations of Observational Equivalences in \u03bb-calculi, to appear in CAAP'97 Proc."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"I. Mason, S. Smith, C. Talcott, From Operational Semantics to Domain Theory, Information and Computation to appear.","DOI":"10.1006\/inco.1996.0061"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"A.M. Pitts, Computational Adequacy via \u2018Mixed\u2019 Inductive Definitions, MFPS'93, Brookes et al. eds., Springer LNCS, 802:72\u201382, 1994.","DOI":"10.1007\/3-540-58027-1_3"},{"key":"16_CR17","unstructured":"A.M. Pitts, A Note on Logical Relations Between Semantics and Syntax, to appear in WoLLIC'96 Proc., J. of the Interest Group in Pure and Applied Logics."},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1996.0052","volume":"127","author":"A.M. Pitts","year":"1996","unstructured":"A.M. Pitts, Relational Properties of Domains, Information and Computation, 127:66\u201390, 1996.","journal-title":"Information and Computation"},{"key":"16_CR19","doi-asserted-by":"crossref","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"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62688-3_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:20:44Z","timestamp":1640949644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62688-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626886","9783540684381"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-62688-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}