{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:40Z","timestamp":1725516220615},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"321-335","source":"Crossref","is-referenced-by-count":2,"title":["A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schauss","sequence":"first","affiliation":[]},{"given":"Elena","family":"Machkasova","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0168-0072(01)00104-X","volume":"117","author":"Z.M. Ariola","year":"2002","unstructured":"Ariola, Z.M., Blom, S.: Skew confluence and the lambda calculus with letrec. Annals of Pure and Applied Logic\u00a0117, 95\u2013168 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR2","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley, Reading (1990)"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1997.2651","volume":"139","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Klop, J.W.: Lambda calculus with explicit recursion. Inform. and Comput.\u00a0139(2), 154\u2013233 (1997)","journal-title":"Inform. and Comput."},{"issue":"3,4","key":"22_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundamentae Informaticae\u00a026(3,4), 207\u2013240 (1996)","journal-title":"Fundamentae Informaticae"},{"issue":"1-2","key":"22_CR5","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":"22_CR6","first-page":"80","volume-title":"POPL 1997","author":"M. Hanus","year":"1996","unstructured":"Hanus, M.: A unified computation model for functional and logic programming. In: POPL 1997, pp. 80\u201393. ACM, New York (1996)"},{"key":"22_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":"22_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":"22_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/289423.289462","volume-title":"ICFP 1998","author":"A. Kutzner","year":"1998","unstructured":"Kutzner, A., Schmidt-Schau\u00df, M.: A nondeterministic call-by-need lambda calculus. In: ICFP 1998, pp. 324\u2013335. ACM Press, New York (1998)"},{"key":"22_CR10","unstructured":"Machkasova, E.: Computational Soundness of Non-Confluent Calculi with Applications to Modules and Linking. PhD thesis, Boston University (2002)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Machkasova, E.: Computational soundness of a call by name calculus of recursively-scoped records. In: 7th WRS. ENTCS (2007)","DOI":"10.1016\/j.entcs.2008.03.059"},{"key":"22_CR12","unstructured":"Mann, M.: Congruence of bisimulation in a non-deterministic call-by-need lambda calculus. In: SOS 2004, BRICS NS-04-1, pp. 20\u201338 (2004)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-48919-3_8","volume-title":"Coordination Languages and Models","author":"A.K.D. Moran","year":"1999","unstructured":"Moran, A.K.D., Sands, D., Carlsson, M.: Erratic fudgets: A semantic theory for an embedded coordination language. In: Ciancarini, P., Wolf, A.L. (eds.) COORDINATION 1999. LNCS, vol.\u00a01594, pp. 85\u2013102. Springer, Heidelberg (1999)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-46425-5_17","volume-title":"Programming Languages and Systems","author":"E. Machkasova","year":"2000","unstructured":"Machkasova, E., Turbak, F.A.: A calculus for link-time compilation. In: Smolka, G. (ed.) ESOP 2000 and ETAPS 2000. LNCS, vol.\u00a01782, pp. 260\u2013274. Springer, Heidelberg (2000)"},{"key":"22_CR15","volume-title":"Haskell 98 language and libraries: the Revised Report","author":"S.P. Jones","year":"2003","unstructured":"Jones, S.P.: Haskell 98 language and libraries: the Revised Report. Cambridge University Press, Cambridge (2003), http:\/\/www.haskell.org"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S., Gordon, A., Finne, S.: Concurrent Haskell. In: Proc. 23th Principles of Programming Languages (1996)","DOI":"10.1145\/237721.237794"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value, and the lambda-calculus. Theoret. Comput. Sci.\u00a01, 125\u2013159 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR18","unstructured":"Schmidt-Schau\u00df, M., Mann, M.: On equivalences and standardization in a non-deterministic call-by-need lambda calculus. Frank report\u00a031, Inst. f. Informatik, J.W.Goethe-University, Frankfurt (August 2007)"},{"key":"22_CR19","unstructured":"Schmidt-Schau\u00df, M., Machkasova, E.: A finite simulation method in a non-deterministic call-by-need calculus with letrec, constructors and case. Frank\u00a032, Inst. f. Informatik, J.W.Goethe-University, Frankfurt (2008)"},{"key":"22_CR20","doi-asserted-by":"crossref","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 (accepted for publication, 2007)","DOI":"10.1017\/S0960129508006774"},{"key":"22_CR21","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: On generic context lemmas for lambda calculi with sharing. Frank\u00a027, Inst. Informatik, J.W.G-Univ., Frankfurt (2007)"},{"key":"22_CR22","unstructured":"Schmidt-Schau\u00df, M., Sch\u00fctz, M., Sabel, D.: On the safety of N\u00f6cker\u2019s strictness analysis. Frank\u00a019, Inst. Informatik, J.W.G-Univ., Frankfurt (2004)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Schmidt-Schau\u00df, M., Sch\u00fctz, M., Sabel, D.: Safety of N\u00f6cker\u2019s strictness analysis. J. Funct. Programming (accepted for publication, 2008)","DOI":"10.1017\/S0956796807006624"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-44881-0_8","volume-title":"Rewriting Techniques and Applications","author":"J.B. Wells","year":"2003","unstructured":"Wells, J.B., Plump, D., Kamareddine, F.: Diagrams for meaning preservation. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 88\u2013106. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:20Z","timestamp":1605762500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}