{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:15:54Z","timestamp":1725495354598},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658368"},{"type":"electronic","value":"9783540489191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48919-3_8","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:48:02Z","timestamp":1194990482000},"page":"85-102","source":"Crossref","is-referenced-by-count":9,"title":["Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Moran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"issue":"6","key":"8_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z. M. Ariola","year":"1997","unstructured":"Z. M. Ariola and M. Felleisen, The call-by-need lambda calculus, Journal of Functional Programming 7 (1997), no. 6, 265\u2013301.","journal-title":"Journal of Functional Programming"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler, A call-by-need lambda calculus, Proc. POPL\u201995, ACM Press, January 1995, pp. 233\u2013246.","DOI":"10.1145\/199448.199507"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/cpe.4330050103","volume":"5","author":"F. Arbab","year":"1993","unstructured":"F. Arbab, I. Herman, and P. Spilling, An overview of manifold and its implementation, Concurrency: Practice and Experience 5 (1993), no. 1, 23\u201370.","journal-title":"Concurrency: Practice and Experience"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science 96 (1992), no. 1, 217\u2013248.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR5","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 (1986), no. 1, 1\u201361.","journal-title":"Theoretical Computer Science"},{"key":"8_CR6","unstructured":"M. Carlsson and T. Hallgren, Fudgets \u2014 Purely Functional Processes with Applications to Graphical User Interfaces, Ph.D. thesis, Department of Computing Sciences, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden, March 1998."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"W. Clinger, Nondeterministic call by need is neither lazy nor by name, Lisp and Functional Programming, August 1982, pp. 226\u2013234.","DOI":"10.1145\/800068.802154"},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60321-2","volume-title":"Proc. of MFCS\u201995","author":"W. Ferreira","year":"1995","unstructured":"W. Ferreira and M. Hennessy, Towards a semantic theory of CML (extended abstract), Proc. of MFCS\u201995 (J. Wiedermann and P. Hajek, eds.), LNCS, vol. 969, Springer-Verlag, August 1995."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"W. Ferreira, M. Hennessy, and A. Jeffrey, A theory of weak bisimulation for core CML, Proc. ICFP\u201996, ACM Press, May 1996, pp. 201\u2013212.","DOI":"10.1145\/232627.232649"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"S. Finne and S. Peyton Jones Composing Haggis, Proc. of the 5th Eurographics Workshop on Programming Paradigms in Graphics, September 1995.","DOI":"10.1007\/978-3-7091-9457-7_7"},{"key":"8_CR11","unstructured":"E. R. Gansner and J. H. Reppy, eXene, Proceedings of the 1991 CMU Workshop on Standard ML (Carnegie Mellon University), September 1991."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"A. Kutzner and M. Schmidt-Schau\u00df, A non-deterministic call-by-need lambda calculus, Proc. ICFP\u201998, ACM Press, September 1998, pp. 324\u2013335.","DOI":"10.1145\/289423.289462"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"J. Launchbury, A natural semantics for lazy evaluation, Proc. POPL\u201993, ACM Press, January 1993, pp. 144\u2013154.","DOI":"10.1145\/158511.158618"},{"key":"8_CR14","unstructured":"S. B. Lassen and A. K. Moran, An operational theory for McCarthy\u2019s Amb, Submitted for publication, 1998."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully abstract models of the typed \u03bb-calculus, Theoretical Computer Science 4 (1977), 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"8_CR16","unstructured":"A. K. Moran, Call-by-name, call-by-need, and McCarthy\u2019s Amb, Ph.D. thesis, Department of Computing Sciences, Chalmers University of Technology, Gothenburg, Sweden, September 1998."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"A. K. Moran and D. Sands, Improvement in a lazy context: An operational theory for call-by-need, Proc. POPL\u201999, ACM Press, January 1999, pp. 43\u201356.","DOI":"10.1145\/292540.292547"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"A. K. Moran, D. Sands, and M. Carlsson, Erratic Fudgets: A semantic theory for an embedded coordination language (extended version), Extended version of this paper; available from authors, 1998.","DOI":"10.1007\/3-540-48919-3_8"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(95)00017-8","volume":"155","author":"F. Nielson","year":"1996","unstructured":"F. Nielson and H. R. Nielson, From CML to its process algebra, Theoretical Computer Science 155 (1996), no. 1, 179\u2013219.","journal-title":"Theoretical Computer Science"},{"key":"8_CR20","unstructured":"J. Peterson and K. Hammond, The Haskell Report, Version 1.4, Tech. report, Yale University, 1997."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, A. Gordon, and S. Finne, Concurrent Haskell, Proc. POPL\u201996, ACM Press, January 1996, pp. 295\u2013308.","DOI":"10.1145\/237721.237794"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, W. Partain, and A. Santos, Letf-floating: moving bindings to give faster programs, Proc. ICFP\u201996, ACM Press, May 1996, pp. 1\u201312.","DOI":"10.1145\/232627.232630"},{"issue":"1\u20133","key":"8_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(97)00029-4","volume":"32","author":"S. Peyton Jones","year":"1998","unstructured":"S. Peyton Jones and A. Santos, A transformation-based optimiser for Haskell, Science of Computer Programming 32 (1998), no. 1\u20133, 3\u201347.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin, A powerdomain construction, SIAM Journal on Computing 5 (1976), no. 3, 452\u2013487.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"P. Panangaden and V. Shanbhogue, McCarthy\u2019s amb cannot implement fair merge, Tech. Report TR88-913, Cornell University, Computer Science Department, May 1988.","DOI":"10.1007\/3-540-50517-2_90"},{"issue":"6","key":"8_CR26","first-page":"294","volume":"26","author":"J. H. Reppy","year":"1991","unstructured":"J. H. Reppy, CML: A Higher-Order Concurrent Language, Proc. PLDI\u201991, vol. 26, SIGPLAN Notices, no. 6, ACM Press, June 1991, pp. 294\u2013305.","journal-title":"Proc. PLDI\u201991"},{"issue":"4","key":"8_CR27","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/logcom\/5.4.495","volume":"5","author":"D. Sands","year":"1995","unstructured":"D. Sands, A na\u00efve time analysis and its theory of cost equivalence, Journal of Logic and Computation 5 (1995), no. 4, 495\u2013541.","journal-title":"Journal of Logic and Computation"},{"key":"8_CR28","unstructured":"D. Sands, Improvement theory and its applications, (A. D. Gordon and A. M. Pitts, eds.), Publications of the Newton Institute, Cambridge University Press, 1998, pp. 275\u2013306."},{"issue":"3","key":"8_CR29","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"P. Sestoft, Deriving a lazy abstract machine, Journal of Functional Programming 7 (1997), no. 3, 231\u2013264.","journal-title":"Journal of Functional Programming"},{"issue":"23\u201326","key":"8_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smyth","year":"1978","unstructured":"M. B. Smyth, Power domains, Journal of Computer and System Sciences 16 (1978), no. 23\u201326, 23\u201335.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/BFb0036946","volume-title":"ICALP\u2019 83","author":"M. B. Smyth","year":"1983","unstructured":"M. B. Smyth, Power domains and predicate transformers: A topological view, ICALP\u2019 83, LNCS, vol. 154, 1983, pp. 662\u2013676."},{"issue":"5","key":"8_CR32","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 (1992), no. 5, 514\u2013523.","journal-title":"The Computer Journal"},{"key":"8_CR33","unstructured":"C. Taylor, Formalising and Reasoning about Fudgets, Ph.D. thesis, School of Computer Science and Information Technology, University of Nottingham, October 1998."},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"C. Taylor, A theory for Core Fudgets, Proc. ICFP\u201998, ACM Press, September 1998, pp. 75\u201385.","DOI":"10.1145\/289423.289430"}],"container-title":["Lecture Notes in Computer Science","Coordinatio Languages and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48919-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T02:33:16Z","timestamp":1588041196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48919-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658368","9783540489191"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-48919-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}