{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:53Z","timestamp":1725493493145},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403326"},{"type":"electronic","value":"9783540449041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44904-3_15","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T01:49:32Z","timestamp":1193536172000},"page":"211-225","source":"Crossref","is-referenced-by-count":3,"title":["A Fully Abstract Bidomain Model of Unary FPC"],"prefix":"10.1007","author":[{"given":"Jim","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"15_CR1","unstructured":"S. Abramsky. The lazy \u03bb-calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65\u2013117. Addison Wesley, 1990."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Games and full abstraction for the lazy \u03bb-calculus. In Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, pages 234\u2013243. IEEE Computer Society Press, 1995.","DOI":"10.1109\/LICS.1995.523259"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. In P.W. O\u2019Hearn and R. Tennent, editors, Algol-like languages. Birkhauser, 1997.","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy \u03bb-calculus. Information and Computation, 105:159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF. Information and Computation, 163:409\u2013470, 2000.","journal-title":"Information and Computation"},{"key":"15_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-08860-1_7","volume-title":"Proceedings of the 5th International Colloquium on Automata, Languages and Programming","author":"G. Berry","year":"1978","unstructured":"G. Berry. Stable models of typed \u03bb-calculi. In Proceedings of the 5th International Colloquium on Automata, Languages and Programming, number 62 in LNCS, pages 72\u201389. Springer, 1978."},{"key":"15_CR7","unstructured":"G. Berry. Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s. PhD thesis, Universit\u00e9 Paris 7, 1979."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(93)90005-E","volume":"113","author":"A. Bucciarelli","year":"1993","unstructured":"A. Bucciarelli and T. Ehrhard. A theory of sequentiality. Theoretical Computer Science, 113:273\u2013292, 1993.","journal-title":"Theoretical Computer Science"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"R. Cartwright and M. Felleisen. Observable sequentiality and full abstraction. In Proceedings of POPL\u2019 92, 1992.","DOI":"10.1145\/143165.143232"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"R. Cartwright, P.-L. Curien and M. Felleisen. Fully abstract semantics for observably sequential languages. Information and Computation, 1994.","DOI":"10.1006\/inco.1994.1047"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"P.-L. Curien. Categorical combinators, sequential algorithms and functional programming. Progress in Theoretical Computer Science series. Birkhauser, 1993.","DOI":"10.1007\/978-1-4612-0317-9"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"P.-L. Curien, G. Winskell, and G. Plotkin. Bistructures, bidomains and linear logic. In Milner Festschrift. MIT Press, 1997.","DOI":"10.7146\/brics.v4i15.18805"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22:465\u2013476, 1979.","journal-title":"Communications of the ACM"},{"key":"15_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of TLCA\u2019 01","author":"P. Gianantonio di","year":"2001","unstructured":"P. di Gianantonio. Games semantics for the pure lazy \u03bb-calculus. In S. Abramsky, editor, Proceedings of TLCA\u2019 01, number 2044 in LNCS. Springer, 2001."},{"key":"15_CR15","unstructured":"M. Fiore and G. Plotkin. An axiomatisation of compuationally adequate domain thoeretic models of FPC. In Proceedings of LICS\u2019 94, pages 92\u2013102. IEEE Computer Society Press, 1994."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J. M. E. Hyland","year":"2000","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. Information and Computation, 163:285\u2013408, 2000.","journal-title":"Information and Computation"},{"key":"15_CR17","unstructured":"J. Laird. Bistability and bisequentiality. Available from the author\u2019s home page, 2002."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"R. Loader. Unary PCF is decidable. Theoretical Computer Science, 206, 1998.","DOI":"10.1016\/S0304-3975(98)00048-6"},{"key":"15_CR19","unstructured":"R. Loader. Finitary PCF is undecidable. Annals of Pure and Applied Logic, 2000."},{"key":"15_CR20","unstructured":"J. Longley. The sequentially realizable functionals. Technical Report ECS-LFCS-98-402, LFCS, Univ. of Edinburgh, 1998."},{"key":"15_CR21","unstructured":"G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996."},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1995.1103","volume":"120","author":"P.W. O\u2019Hearn","year":"1995","unstructured":"P.W. O\u2019Hearn and R. Tennent. Kripke logical relations and PCF. Information and Computation, 120(1):107\u2013116, 1995.","journal-title":"Information and Computation"},{"key":"15_CR23","doi-asserted-by":"publisher","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":"15_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223\u2013255, 1977.","journal-title":"Theoretical Computer Science"},{"key":"15_CR25","unstructured":"G. Plotkin. Postgraduate lecture notes in advanced domain theory (incorporating the \u2018Pisa notes\u2019). Available from http:\/\/www.dcs.ed.ac.uk\/home\/gdp\/publications\/ , 1981."},{"key":"15_CR26","unstructured":"G. Plotkin. Lectures on predomains and partial functions, 1985. Notes for a course given at the Center for the study of Language and Information, Stanford."},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"J. Riecke and A. Sandholm. A relational account of call-by-value sequentiality. In Proceedings of the Twelfth Annual Symposium on Logic in Computer Science, LICS\u2019 97. IEEE Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614953"},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00024-3","volume":"216","author":"M. Schmidt-Schau\u00df","year":"1999","unstructured":"M. Schmidt-Schau\u00df. Decidability of behavioural equivalence in unary PCF. Theoretical Computer Science, 216:363\u2013373, 1999.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"15_CR29","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M. Smyth","year":"1982","unstructured":"M. Smyth and G. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11(4):761\u2013783, 1982.","journal-title":"SIAM Journal on 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\/3-540-44904-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:27:24Z","timestamp":1556922444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44904-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403326","9783540449041"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-44904-3_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}