{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:37Z","timestamp":1725493477580},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664086"},{"type":"electronic","value":"9783540483403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:04:52Z","timestamp":1184605492000},"page":"198-208","source":"Crossref","is-referenced-by-count":4,"title":["Unique Fixed Point Induction for McCarthy\u2019s Amb"],"prefix":"10.1007","author":[{"given":"S\u00f8ren B.","family":"Lassen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K. R. Apt","year":"1986","unstructured":"K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724\u2013767, 1986.","journal-title":"Journal of the ACM"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","volume-title":"TACS\u2019 91","author":"S. Arun-Kumar","year":"1991","unstructured":"S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. In TACS\u2019 91, LNCS 526. Springer, 1991."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90040-X","volume":"45","author":"M. Broy","year":"1986","unstructured":"M. Broy. A theory for nondeterminism, parallelism, communication, and concurrency. Theoretical Computer Science, 45(1):1\u201361, 1986.","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","volume-title":"Functional Programming and Input\/Output","author":"A. D. Gordon","year":"1994","unstructured":"A. D. Gordon. Functional Programming and Input\/Output. Distinguished Dissertations in Computer Science. Cambridge U. P., 1994."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"A. D. Gordon. Bisimilarity as a theory of functional programming. In MFPS XI, ENTCS 1. Elsevier, 1995.","DOI":"10.1016\/S1571-0661(04)80013-6"},{"volume-title":"Higher Order Operational Techniques in Semantics","year":"1998","key":"18_CR6","unstructured":"A. D. Gordon and A. M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge U. P., 1998."},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. Howe","year":"1996","unstructured":"D. Howe. Proving congruence of bisimulation in functional programming. Information and Computation, 124(2):103\u2013112, 1996.","journal-title":"Information and Computation"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J. Hughes and J. T. O\u2019Donnell. Expressing and reasoning about non-deterministic functional programs. In Functional Programming, Glasgow, 1989, Workshops in Computing. Springer, 1989.","DOI":"10.1007\/978-1-4471-3166-3_21"},{"key":"18_CR9","first-page":"91","volume-title":"Higher Order Operational Techniques in Semantics","author":"S. B. Lassen","year":"1998","unstructured":"S. B. Lassen. Relational reasoning about contexts. In A. M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge U. P., 1998 Gordon and Pitts [6], pages 91\u2013135."},{"key":"18_CR10","unstructured":"S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Dept. of Computer Science, University of Aarhus, May 1998."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"S. B. Lassen and C. S. Pitcher. Similarity and bisimilarity for countable nondeterminism and higher-order functions. In HOOTS II, ENTCS 10. Elsevier, 1998.","DOI":"10.1016\/S1571-0661(05)80704-2"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J. McCarthy. A basis for a mathematical theory of computation. In Computer Programming and Formal Systems, pages 33\u201370. North-Holland, 1963.","DOI":"10.1016\/S0049-237X(08)72018-4"},{"key":"18_CR13","unstructured":"A. K. Moran. Call-by-name, Call-by-need, and McCarthy\u2019s Amb. PhD thesis, Dept. of Computer Science, Chalmers University of Technology, Sept. 1998."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"A. K. Moran and D. Sands. Improvement in a lazy context: An operational theory for call-by-need. In POPL\u2019 99. ACM, 1999.","DOI":"10.1145\/292540.292547"},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Coordination\u2019 99","author":"A. K. Moran","year":"1999","unstructured":"A. K. Moran, D. Sands, and M. Carlsson. Erratic Fudgets: A semantic theory for an embedded coordination language. In Coordination\u2019 99, LNCS 1594. Springer, 1999."},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","volume-title":"CSL\u2019 97","author":"Y. N. Moschovakis","year":"1998","unstructured":"Y. N. Moschovakis. A game-theoretic, concurrent and fair model of the typed lambda-calculus, with full recursion. In CSL\u2019 97, LNCS 1414. Springer, 1998."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"C.-H. L. Ong. Non-determinism in a functional setting. In LICS\u2019 93. IEEE, 1993.","DOI":"10.1109\/LICS.1993.287580"},{"key":"18_CR18","first-page":"275","volume-title":"Higher Order Operational Techniques in Semantics","author":"D. Sands","year":"1998","unstructured":"D. Sands. Improvement theory and its applications. In A. M. Pitts, editors. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge U. P., 1998 Gordon and Pitts [6]}, pages 275\u2013306."},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/3-540-60246-1_153","volume-title":"MFCS\u2019 95","author":"D. Sangiorgi","year":"1995","unstructured":"D. Sangiorgi. On the bisimulation proof method. In MFCS\u2019 95, LNCS 969, pages 479\u2013488. Springer, 1995."},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u2019 92","author":"D. Sangiorgi","year":"1992","unstructured":"D. Sangiorgi and R. Milner. The problem of \u201cweak bisimulation up to\u201d. In CONCUR\u2019 92, LNCS 789. Springer, 1992."},{"issue":"5","key":"18_CR21","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1093\/comjnl\/35.5.514","volume":"35","author":"H. S\u00f8ndergaard","year":"1992","unstructured":"H. S\u00f8ndergaard and P. Sestoft. Non-determinism in functional languages. The Computer Journal, 35(5):514\u2013523, 1992.","journal-title":"The Computer Journal"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P. Wadler","year":"1992","unstructured":"P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2:461\u2013493, 1992.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:55:15Z","timestamp":1556682915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}