{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:46Z","timestamp":1725544066720},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11690634_24","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:15:28Z","timestamp":1143537328000},"page":"352-366","source":"Crossref","is-referenced-by-count":3,"title":["Bidomains and Full Abstraction for Countable Nondeterminism"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., Plotkin, G.D.: Countable nondeterminism and random assignment. Journal of the ACM\u00a033(4), 724\u2013767 (1986)","journal-title":"Journal of the ACM"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"Berry, G.: Stable models of typed \u03bb-calculi. In: Proceedings of the 5th International Colloquium on Automata, Languages and Programming. LNCS, vol.\u00a062, pp. 72\u201389. Springer, Heidelberg (1978)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction. In: Proceedings of POPL 1992 (1992)","DOI":"10.1145\/143165.143232"},{"key":"24_CR4","volume-title":"Milner Festschrift","author":"P.-L. Curien","year":"1997","unstructured":"Curien, P.-L., Winskel, G., Plotkin, G.: Bistructures, bidomains and linear logic. In: Milner Festschrift, MIT Press, Cambridge (1997)"},{"issue":"2","key":"24_CR5","first-page":"126","volume":"2","author":"P. Gianantonio Di","year":"1995","unstructured":"Di Gianantonio, P., Honsell, F., Plotkin, G.: Uncountable limits and the lambda calculus. Nordic Journal of Computing\u00a02(2), 126\u2013145 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"24_CR6","volume-title":"Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999","author":"R. Harmer","year":"1998","unstructured":"Harmer, R., McCusker, G.: A fully abstract games semantics for finite non-determinism. In: Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999, IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45220-1_30","volume-title":"Computer Science Logic","author":"J. Laird","year":"2003","unstructured":"Laird, J.: Bistability: an extensional characterization of sequentiality. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, Springer, Heidelberg (2003)"},{"key":"24_CR8","first-page":"173","volume":"65","author":"J. Laird","year":"2005","unstructured":"Laird, J.: Sequentiality in bounded bidomains. Fundamenta Informaticae\u00a065, 173\u2013191 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Lassen, S.B., Pitcher, C.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electronic Notes in Theoretical Computer Science\u00a010 (1997)","DOI":"10.1016\/S1571-0661(05)80704-2"},{"key":"24_CR10","unstructured":"Levy, P.B.: Infinite trace equivalence. In: Games for Logic and Programming Languages, pp. 195\u2013209 (2005)"},{"key":"24_CR11","volume-title":"Domain Theory, Logic and Computation: Proceedings of the 2 nd International Symposium on Domain Theory","author":"J. Longley","year":"2004","unstructured":"Longley, J.: Universal types and what they are good for. In: Domain Theory, Logic and Computation: Proceedings of the 2 nd International Symposium on Domain Theory, Kluwer, Dordrecht (2004)"},{"key":"24_CR12","unstructured":"Plotkin, G.: Lectures on predomains and partial functions, Notes for a course given at the Center for the study of Language and Information, Stanford (1985)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T13:19:00Z","timestamp":1555507140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11690634_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}