{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:31Z","timestamp":1725537211623},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04027-6_28","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T13:27:52Z","timestamp":1252934872000},"page":"379-393","source":"Crossref","is-referenced-by-count":1,"title":["Nondeterminism and Observable Sequentiality"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-08860-1_7","volume-title":"Automata, Languages and Programming","author":"G. Berry","year":"1978","unstructured":"Berry, G.: Stable models of typed \u03bb-calculi. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 72\u201389. Springer, Heidelberg (1978)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science\u00a020, 265\u2013321 (1982)","journal-title":"Theoretical Computer Science"},{"key":"28_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":"28_CR4","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Curien, P.-L., Felleisen, M.: Fully abstract semantics for observably sequential languages. Information and Computation (1994)","DOI":"10.1006\/inco.1994.1047"},{"key":"28_CR5","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)"},{"key":"28_CR6","unstructured":"Harmer, R.: Games and Full Abstraction for Nondeterministic Languages. PhD thesis, Imperial College London (1999)"},{"key":"28_CR7","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":"28_CR8","volume-title":"Proceedings of LICS 2002","author":"M. Hyland","year":"2002","unstructured":"Hyland, M., Schalk, A.: Games on graphs and sequentially realizable functionals. In: Proceedings of LICS 2002. IEEE Press, Los Alamitos (2002)"},{"key":"#cr-split#-28_CR9.1","doi-asserted-by":"crossref","unstructured":"Kahn, G., Plotkin, G.: Concrete domains. Theoretical Computer Science, B\u00f6hm Festschrift special issue (1993);","DOI":"10.1016\/0304-3975(93)90090-G"},{"key":"#cr-split#-28_CR9.2","unstructured":"First appeared as technical report 338 of INRIA-LABORIA (1978)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2005.06.007","volume":"342","author":"J. Laird","year":"2005","unstructured":"Laird, J.: Locally Boolean domains. Theoretical Computer Science\u00a0342, 132\u2013148 (2005)","journal-title":"Theoretical Computer Science"},{"key":"28_CR11","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":"28_CR12","doi-asserted-by":"crossref","unstructured":"Laird, J.: Bistability: A sequential domain theory. Logical Methods in Computer Science\u00a03 (2007)","DOI":"10.2168\/LMCS-3(2:5)2007"},{"issue":"4","key":"28_CR13","first-page":"511","volume":"77","author":"J. Laird","year":"2007","unstructured":"Laird, J.: On the expressiveness of affine progams with non-local control: The elimination of nesting in SPCF. Fundamenta Informaticae\u00a077(4), 511\u2013531 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"28_CR14","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 Academic Publishers, Dordrecht (2004)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:19:28Z","timestamp":1558523968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}