{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:06Z","timestamp":1725558426405},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_30","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"372-383","source":"Crossref","is-referenced-by-count":4,"title":["Bistability: An Extensional Characterization of Sequentiality"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"30_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(93)90005-E","volume":"113","author":"A. Bucciarelli","year":"1993","unstructured":"Bucciarelli, A., Ehrhard, T.: A theory of sequentiality. Theoretical Computer Science\u00a0113, 273\u2013292 (1993)","journal-title":"Theoretical Computer Science"},{"key":"30_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":"30_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":"30_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Programming Semantics","author":"P.-L. Curien","year":"1994","unstructured":"Curien, P.-L.: On the symmetry of sequentiality. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, Springer, Heidelberg (1994)"},{"key":"30_CR6","unstructured":"Curien, P.-L.: Sequential algorithms as bistable maps (2002) (unpublished note)"},{"key":"30_CR7","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, Los Alamitos (2002)"},{"key":"#cr-split#-30_CR8.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#-30_CR8.2","unstructured":"First appeared as technical report 338 of INRIALABORIA (1978)"},{"key":"30_CR9","unstructured":"Laird, J.: A fully abstract and effectively presentable model of unary FPC. To appear in the Proceedings of TLCA 2003 (2003)"},{"key":"30_CR10","unstructured":"Lamarche, F.: Sequentiality, games and linear logic. In: Proceedings, CLICS workshop, Aarhus University. DAIMI-397\u2013II (1992)"},{"key":"30_CR11","unstructured":"Loader, R.: Finitary PCF is undecidable. Annals of Pure and Applied Logic (2000)"},{"key":"30_CR12","unstructured":"Longley, J.: The sequentially realizable functionals. Technical Report ECS-LFCS- 98-402, LFCS, Univ. of Edinburgh (1998)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Types for Proofs and Programs","author":"V. Padovani","year":"1996","unstructured":"Padovani, V.: Decidability of all minimal models. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol.\u00a01158, Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:01:35Z","timestamp":1559221295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}