{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:30:59Z","timestamp":1693852259623},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00167-7","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"83-116","source":"Crossref","is-referenced-by-count":5,"title":["From B\u00f6hm's Theorem to Observational Equivalences"],"prefix":"10.1016","volume":"50","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elio","family":"Giovannetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","article-title":"Full abstraction in the lazy lambda calculus","volume":"105","author":"Abramsky","year":"1993","journal-title":"Inform. and Comput"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB2","doi-asserted-by":"crossref","unstructured":"F. Barbanera, M. Dezani-Ciancaglini, and F.-J. de Vries. Types for trees. In Proceedings of PROCOMET'98, pages 11\u201329. Chapman & Hall, London, 1998.","DOI":"10.1007\/978-0-387-35358-6_6"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB3","series-title":"The lambda calculus. Its syntax and semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB4","series-title":"Logic and algebra (Pontignano, 1994)","first-page":"339","article-title":"Infinite \u03bb-calculus and non-sensible models","author":"Berarducci","year":"1996"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB5","first-page":"1","article-title":"Alcune propriet\u00e0 delle forme \u03b2-\u03b7-normali nel \u03bb-K-calcolo","volume":"696","author":"B\u00f6hm","year":"1968","journal-title":"Pubblicazioni dell'IAC"},{"issue":"1","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1996.0037","article-title":"The discriminating power of multiplicities in the \u03bb-calculus","volume":"126","author":"Boudol","year":"1996","journal-title":"Inform. and Comput"},{"issue":"2","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","article-title":"Type theories, normal forms, and D\u221e-lambda-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Inform. and Comput"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB8","doi-asserted-by":"crossref","unstructured":"P.L. Curien. Sur l'eta-expansion infinie. Comptes Rendus de l'Acad\u00e9mie des Sciences, to appear, 2001.","DOI":"10.1016\/S1631-073X(02)02095-2"},{"issue":"5","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB9","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1137\/S0097539794275860","article-title":"A filter model for concurrent \u03bb-calculus","volume":"27","author":"Dezani-Ciancaglini","year":"1998","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB10","series-title":"ICTCS'98 (Prato, 1998)","first-page":"1","article-title":"B\u00f6hm's theorem for B\u00f6hm trees","author":"Dezani-Ciancaglini","year":"1998"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB11","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, P. Severi, and F.-J. de Vries. B\u00f6hm's theorem for Berarducci trees. In CATS'00 (Canberra, 2000), volume 31(1) of Electronic Notes in Theoretical Computer Science, pages 143\u2013166. Elsevier, 2000","DOI":"10.1016\/S1571-0661(05)80329-9"},{"issue":"2","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/inco.1998.2773","article-title":"Discrimination by parallel observers: the algorithm","volume":"150","author":"Dezani-Ciancaglini","year":"1999","journal-title":"Inform. and Comput"},{"issue":"3","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebras and combinators","volume":"13","author":"Engeler","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(93)90087-A","article-title":"An analysis of B\u00f6hm's theorem","volume":"121","author":"Huet","year":"1993","journal-title":"Theoret. Comput. Sci"},{"issue":"3","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","article-title":"A syntactic characterization of the equality in some models for the lambda calculus","volume":"12","author":"Hyland","year":"1975","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB16","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bulletin of EATCS"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-59200-8_62","article-title":"Infinite lambda calculus and B\u00f6hm models","author":"Kennaway","year":"1995","journal-title":"Rewriting Techniques and Applications"},{"issue":"1","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB19","first-page":"35","article-title":"Meaningless terms in rewriting","volume":"1","author":"Kennaway","year":"1999","journal-title":"J. Funct. Logic Programming"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029523","article-title":"An algebraic interpretation of the \u03bb\u03b2K-calculus and a labellel \u03bb-calculus","author":"L\u00e9vy","year":"1975","journal-title":"\u03bb-Calculus and Computer Science Theory"},{"issue":"1","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb\u03b2K-calculus, and an application of a labelled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoret. Comput. Sci"},{"issue":"2","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of \u03bb-calculus: theories, expansions, isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB23","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB24","unstructured":"J.-H. Morris. Lambda calculus models of programming languages. PhD thesis, M.I.T., 1968."},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB25","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In 5th GI Conference on Theoretical Computer Science, pages 167\u2013183. Lecture Notes in Comput. Sci. 184. Springer Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB26","series-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"issue":"1","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB27","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1994.1042","article-title":"The lazy lambda calculus in a concurrency scenario","volume":"111","author":"Sangiorgi","year":"1994","journal-title":"Inform. and Comput"},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB28","unstructured":"D. Sangiorgi. L\u00e9vy-Longo Trees and B\u00f6hm Trees from encodings of \u03bb-calculus into \u03c0-calculus. Notes, 1995."},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB29","unstructured":"D. Sangiorgi. Interpreting functions as pi-calculus processes: a tutorial. Revised version of TR RR-3470, INRIA Sophia Antipolis. Available as ftp:\/\/ftp-sop\/meije\/theorie-par\/davides\/functionPItutorial.ps.gz, 1999."},{"key":"10.1016\/S1571-0661(04)00167-7_NEWBIB30","doi-asserted-by":"crossref","unstructured":"D. Scott. Continuous lattices. In Toposes, algebraic geometry and logic (Conf., Dalhousie Univ., Halifax, N. S., 1971), pages 97\u2013136. Lecture Notes in Math., Vol. 274. Springer, Berlin, 1972","DOI":"10.1007\/BFb0073967"},{"issue":"3","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB31","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput"},{"issue":"3","key":"10.1016\/S1571-0661(04)00167-7_NEWBIB32","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001677?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001677?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:29:04Z","timestamp":1585484944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S1571066104001677"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00167-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}