{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T05:15:36Z","timestamp":1648703736271},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5252,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0304-3975(98)00024-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"363-373","source":"Crossref","is-referenced-by-count":3,"title":["Decidability of behavioural equivalence in unary PCF"],"prefix":"10.1016","volume":"216","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00024-3_BIB1","series-title":"Abstract Interpretations of Declarative Languages","author":"Abramsky","year":"1987"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB2","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"The theory and practice of strictness analysis for higher-order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB4","unstructured":"K. Davis, P. Wadler, Strictness analysis in 4d. In Glasgow functional programming workshop, Aug 90."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving terminations with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB6","series-title":"Proc. 7th Ann. IEEE Symp. on Login in Computer Science","first-page":"2","article-title":"Third order matching is decidable","author":"Dowek","year":"1992"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB7","series-title":"Semantics of programming languages","author":"Gunter","year":"1992"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unifications algorithm for typed gl-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S0304-3975(98)00024-3_BIB9","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S0097539791224212","article-title":"Full abstraction and the context lemma","volume":"25","author":"Jim","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB10","article-title":"The implementatins of the Gofer functional programming system","author":"Jones","year":"1994"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB11","first-page":"245","article-title":"Studying the fully abstract model of PCF within its continuous function model","volume":"523","author":"Jung","year":"1993"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB12","first-page":"109","article-title":"The variable containment problem","volume":"1074","author":"Kahrs","year":"1995"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB13","series-title":"Finitary PCF is not decidable","author":"Loader","year":"1996"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB14","article-title":"An algorithm for the minimal model","author":"Loader","year":"1997","journal-title":"Tech. Report"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB15","unstructured":"R. Loader, Unary PCF is decicable, Theor. Comput. Sci. to appear."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of types \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB18","first-page":"234","article-title":"PCF and the problem of full abstractions","volume":"59","author":"Riecke","year":"1996","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(98)00024-3_BIB19","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","article-title":"A type-theoretical alternative to CUCH, ISWIM, OWHY","volume":"121","author":"Scott","year":"1993","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00024-3_BIB20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0747-7171(89)80023-9","article-title":"Higher-order unifications revisited: Complete sets of trasformations","volume":"8","author":"Snyder","year":"1989","journal-title":"J. Symbolic Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:57Z","timestamp":1556315937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0304397598000243"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00024-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}