{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:05:29Z","timestamp":1746331529960,"version":"3.40.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089171"},{"type":"electronic","value":"9783319089188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_26","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"379-394","source":"Crossref","is-referenced-by-count":1,"title":["Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sabel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley (1990)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90040-X","volume":"45","author":"M. Broy","year":"1986","unstructured":"Broy, M.: A theory for nondeterminism, parallelism, communication, and concurrency. Theoret. Comput. Sci.\u00a045, 1\u201361 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tcs.2004.10.005","volume":"330","author":"A. Carayol","year":"2005","unstructured":"Carayol, A., Hirschkoff, D., Sangiorgi, D.: On the representation of McCarthy\u2019s amb in the pi-calculus. Theoret. Comput. Sci.\u00a0330(3), 439\u2013473 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR4","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1992)"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Program.\u00a063(1), 131\u2013173 (2005)","journal-title":"J. Log. Algebr. Program."},{"issue":"1-2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(98)00353-3","volume":"228","author":"A.D. Gordon","year":"1999","unstructured":"Gordon, A.D.: Bisimilarity as a theory of functional programming. Theoret. Comput. Sci.\u00a0228(1-2), 5\u201347 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Howe, D.: Equality in lazy computation systems. In: 4th IEEE Symp. on Logic in Computer Science, pp. 198\u2013203 (1989)","DOI":"10.1109\/LICS.1989.39174"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. Howe","year":"1996","unstructured":"Howe, D.: Proving congruence of bisimulation in functional programming languages. Inform. and Comput.\u00a0124(2), 103\u2013112 (1996)","journal-title":"Inform. and Comput."},{"key":"26_CR9","unstructured":"Laneve, C.: On testing equivalence: May and must testing in the join-calculus. Technical Report Technical Report UBLCS 96-04, University of Bologna (1996)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.entcs.2005.11.068","volume":"155","author":"S.B. Lassen","year":"2006","unstructured":"Lassen, S.B.: Normal form simulation for McCarthy\u2019s amb. Electr. Notes Theor. Comput. Sci.\u00a0155, 445\u2013465 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-48340-3_18","volume-title":"Mathematical Foundations of Computer Science 1999","author":"S.B. Lassen","year":"1999","unstructured":"Lassen, S.B., Moran, A.: Unique fixed point induction for McCarthy\u2019s amb. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 198\u2013208. Springer, Heidelberg (1999)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Lassen, S.B., Pitcher, C.S.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electron. Notes Theor. Comput. Sci. 10 (2000)","DOI":"10.1016\/S1571-0661(05)80704-2"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Relational Reasoning about Functions and Nondeterminism. PhD thesis, University of Aarhus (1998)","DOI":"10.7146\/brics.v4i24.18950"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.entcs.2007.02.036","volume":"173","author":"P.B. Levy","year":"2007","unstructured":"Levy, P.B.: Amb breaks well-pointedness, ground amb doesn\u2019t. Electron. Notes Theor. Comput. Sci.\u00a0173(1), 221\u2013239 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.entcs.2004.09.041","volume":"128","author":"M. Mann","year":"2005","unstructured":"Mann, M.: Congruence of bisimulation in a non-deterministic call-by-need lambda calculus. Electron. Notes Theor. Comput. Sci.\u00a0128(1), 81\u2013101 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"3","key":"26_CR16","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ic.2009.11.003","volume":"208","author":"M. Mann","year":"2010","unstructured":"Mann, M., Schmidt-Schau\u00df, M.: Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. Inform. and Comput.\u00a0208(3), 276\u2013291 (2010)","journal-title":"Inform. and Comput."},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I. Mason","year":"1991","unstructured":"Mason, I., Talcott, C.L.: Equivalence in functional languages with effects. J. Funct. Programming\u00a01(3), 287\u2013327 (1991)","journal-title":"J. Funct. Programming"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume-title":"Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"McCarthy, J.: A Basis for a Mathematical Theory of Computation. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 33\u201370. North-Holland, Amsterdam (1963)"},{"key":"26_CR19","unstructured":"Moran, A.K.D.: Call-by-name, call-by-need, and McCarthy\u2019s Amb. PhD thesis, Chalmers University, Sweden (1998)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.entcs.2007.02.041","volume":"173","author":"J. Niehren","year":"2007","unstructured":"Niehren, J., Sabel, D., Schmidt-Schau\u00df, M., Schwinghammer, J.: Observational semantics for a concurrent lambda calculus with reference cells and futures. Electron. Notes Theor. Comput. Sci.\u00a0173, 313\u2013337 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Ong, C.H.L.: Non-determinism in a functional setting. In: Vardi, M.Y. (ed.) Proc. 8th IEEE Symposium on Logic in Computer Science, pp. 275\u2013286. IEEE Computer Society Press (1993)","DOI":"10.1109\/LICS.1993.287580"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Howe\u2019s method for higher-order languages. In: Sangiorgi, D., Rutten, J. (eds.) Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, ch.\u00a05, pp. 197\u2013232. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511792588.006"},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A. Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inform. and Comput.\u00a0205(2), 125\u2013198 (2007)","journal-title":"Inform. and Comput."},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0960129508006774","volume":"18","author":"D. Sabel","year":"2008","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Math. Structures Comput. Sci.\u00a018(3), 501\u2013553 (2008)","journal-title":"Math. Structures Comput. Sci."},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A contextual semantics for Concurrent Haskell with futures. In: Schneider-Kamp, P., Hanus, M. (eds.) Proc. 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 101\u2013112. ACM (2011)","DOI":"10.1145\/2003476.2003492"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: Conservative concurrency in Haskell. In: Dershowitz, N. (ed.) Proc. 27th ACM\/IEEE Symposium on Logic in Computer Science (LICS 2012), pp. 561\u2013570. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.66"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Correctness of an STM Haskell implementation. In: Morrisett, G., Uustalu, T. (eds.) Proc. 18th ACM SIGPLAN International Conference on Functional Programming, pp. 161\u2013172. ACM (2013)","DOI":"10.1145\/2544174.2500585"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Applicative may- and should-simulation in the call-by-value lambda calculus with amb. Frank report\u00a054. Inst. f. Informatik, Goethe-University, Frankfurt (2014), http:\/\/www.ki.informatik.uni-frankfurt.de\/papers\/frank\/frank-54.pdf","DOI":"10.1007\/978-3-319-08918-8_26"},{"issue":"14","key":"26_CR29","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ipl.2011.04.011","volume":"111","author":"M. Schmidt-Schau\u00df","year":"2011","unstructured":"Schmidt-Schau\u00df, M., Sabel, D., Machkasova, E.: Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Inf. Process. Lett.\u00a0111(14), 711\u2013716 (2011)","journal-title":"Inf. Process. Lett."},{"key":"26_CR30","unstructured":"Koutavas, V., Levy, P.B., Sumii, E.: Limitations of applicative bisimulation. In: Modelling, Controlling and Reasoning about State. Dagstuhl Seminar Proceedings, vol.\u00a010351 (2010)"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:44:48Z","timestamp":1746290688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}