{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:59Z","timestamp":1725489359829},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_25","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"329-343","source":"Crossref","is-referenced-by-count":1,"title":["Correctness of Copy in Calculi with Letrec"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","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. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley, Reading (1990)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Blom, S.: Cyclic lambda calculi. In: TACS, pp. 77\u2013106, Sendai, Japan (1997)","DOI":"10.1007\/BFb0014548"},{"key":"25_CR3","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"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. J. functional programming\u00a07(3), 265\u2013301 (1997)","journal-title":"J. functional programming"},{"key":"25_CR5","first-page":"233","volume-title":"Principles of Programming Languages","author":"Z.M. Ariola","year":"1995","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: A call-by-need lambda calculus. In: Principles of Programming Languages, San Francisco, California, pp. 233\u2013246. ACM Press, New York (1995)"},{"issue":"2","key":"25_CR6","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. Information and Computation\u00a0139(2), 154\u2013233 (1997)","journal-title":"Information and Computation"},{"key":"25_CR7","unstructured":"Barendregt, H.P.: The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam, New York (1984)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-46674-6_7","volume-title":"Advances in Computing Science - ASIAN\u201999","author":"K. Claessen","year":"1999","unstructured":"Claessen, K., Sands, D.: Observable sharing for functional circuit description. In: Thiagarajan, P.S., Yap, R. (eds.) ASIAN 1999. LNCS, vol.\u00a01742, pp. 62\u201373. Springer, Heidelberg (1999)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/inco.1998.2773","volume":"150","author":"M. Dezani-Ciancaglini","year":"1999","unstructured":"Dezani-Ciancaglini, M., Tiuryn, J., Urzyczyn, P.: Discrimination by parallel observers: The algorithm. Information and Computation\u00a0150(2), 153\u2013186 (1999)","journal-title":"Information and Computation"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: A fully abstract semantics for concurrent graph reduction. In: Proc. LICS, pp. 82\u201391 (1994)","DOI":"10.1109\/LICS.1994.316084"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"R. Kennaway","year":"1997","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculus. Theor. Comput. Sci.\u00a0175(1), 93\u2013125 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Proc. 20th Principles of Programming Languages (1993)","DOI":"10.1145\/158511.158618"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Machkasova, E., Turbak, F.A.: A calculus for link-time compilation. In: ESOP 2000 (2000)","DOI":"10.1007\/3-540-46425-5_17"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1017\/S0956796898003037","volume":"8","author":"J. Maraist","year":"1998","unstructured":"Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. J. Functional programming\u00a08, 275\u2013317 (1998)","journal-title":"J. Functional programming"},{"key":"25_CR15","unstructured":"Moran, A.K.D.: Call-by-name, call-by-need, and McCarthys Amb. PhD thesis, Dept. of Comp. Science, Chalmers University, Sweden (1998)"},{"key":"25_CR16","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)"},{"issue":"1-2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0167-6423(02)00088-6","volume":"46","author":"A.K.D. Moran","year":"2003","unstructured":"Moran, A.K.D., Sands, D., Carlsson, M.: Erratic fudgets: A semantic theory for an embedded coordination language. Sci. Comput. Program.\u00a046(1-2), 99\u2013135 (2003)","journal-title":"Sci. Comput. Program."},{"key":"25_CR18","volume-title":"Haskell 98 Language and Libraries","author":"S. Peyton Jones","year":"2003","unstructured":"Peyton Jones, S.: Haskell 98 Language and Libraries. Cambridge University Press, Cambridge (2003), \n                  \n                    www.haskell.org"},{"key":"25_CR19","unstructured":"Plasmeijer, R., van Eekelen, M.: The concurrent Clean language report: Version 1.3 and 2.0. Technical report, Dept. of Computer Science, University of Nijmegen (2003), \n                  \n                    http:\/\/www.cs.kun.nl\/~clean\/"},{"key":"25_CR20","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. Theoretical Computer Science\u00a01, 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"key":"25_CR21","unstructured":"Sabel, D., Schmidt-Schau\u00df, M.: A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Frank report\u00a024, Inst. Informatik. J.W.G.-university Frankfurt (2006)"},{"key":"25_CR22","unstructured":"Schmidt-Schau\u00df, M.: Equivalence of call-by-name and call-by-need for lambda-calculi with letrec. Frank report\u00a025, Inst. Informatik. J.W.G.-university Frankfurt (2006)"},{"key":"25_CR23","unstructured":"Schmidt-Schau\u00df, M.: Correctness of copy in calculi with letrec, case and constructors. Frank report\u00a028, Inst. Informatik. J.W.G.-University Frankfurt (2007)"},{"key":"25_CR24","unstructured":"Schmidt-Schau\u00df, M., Sch\u00fctz, M., Sabel, D.: A complete proof of the safety of N\u00f6cker\u2019s strictness analysis. Frank report\u00a020, Inst. Informatik. J.W.G.-University Frankfurt (2005)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:35Z","timestamp":1619518355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}