{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:39:14Z","timestamp":1743050354067,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205507"},{"type":"electronic","value":"9783642205514"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20551-4_1","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T12:04:40Z","timestamp":1303301080000},"page":"1-20","source":"Crossref","is-referenced-by-count":3,"title":["Three Syntactic Theories for Combinatory Graph Reduction"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Danvy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Zerny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"8","volume-title":"Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003)","author":"M.S. Ager","year":"2003","unstructured":"Ager, M.S., Biernacki, D., Danvy, O., Midtgaard, J.: A functional correspondence between evaluators and abstract machines. In: Miller, D. (ed.) Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), Uppsala, Sweden, August 2003, pp. 8\u201319. ACM Press, New York (2003)"},{"issue":"1-2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","volume":"146","author":"Z.M. Ariola","year":"1995","unstructured":"Ariola, Z.M., Arvind: Properties of a first-order functional language with sharing. Theoretical Computer Science\u00a0146(1-2), 69\u2013108 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR3","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. Journal of Functional Programming\u00a07(3), 265\u2013301 (1997)","journal-title":"Journal of Functional Programming"},{"key":"1_CR4","first-page":"233","volume-title":"Proceedings of the Twenty-Second Annual ACM Symposium on 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: Lee, P. (ed.) Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, January 1995, pp. 233\u2013246. ACM Press, New York (1995)"},{"issue":"3\/4","key":"1_CR5","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. Fundamenta Informaticae\u00a026(3\/4), 207\u2013240 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"1_CR6","series-title":"Studies in Logic and the Foundation of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundation of Mathematics, vol.\u00a0103, revised edition. North-Holland, Amsterdam (1984)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, R., Plasmeijer, M.J., Sleep, M.R.: Term graph rewriting. In: de Bakker, J., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"1_CR8","unstructured":"Blom, S.: Term Graph Rewriting \u2013 Syntax and Semantics. PhD thesis, Institute for Programming Research and Algorithmics, Vrije Universiteit, Amsterdam, The Netherlands (Mar 2001)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.2307\/1968167","volume":"34","author":"H.B. Curry","year":"1933","unstructured":"Curry, H.B.: Apparent variables from the standpoint of Combinatory Logic. Annals of Mathematics\u00a034, 381\u2013404 (1933)","journal-title":"Annals of Mathematics"},{"key":"1_CR10","series-title":"SIGPLAN Notices","first-page":"131","volume-title":"Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP 2008)","author":"O. Danvy","year":"2008","unstructured":"Danvy, O.: Defunctionalized interpreters for programming languages. In: Thiemann, P. (ed.) Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), Victoria, British Columbia, September 2008. SIGPLAN Notices, vol.\u00a043(9), pp. 131\u2013142. ACM Press, New York (2008) (invited talk)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-04652-0_3","volume-title":"Advanced Functional Programming","author":"O. Danvy","year":"2009","unstructured":"Danvy, O.: From reduction-based to reduction-free normalization. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol.\u00a05832, pp. 66\u2013164. Springer, Heidelberg (2009)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ipl.2007.10.010","volume":"106","author":"O. Danvy","year":"2008","unstructured":"Danvy, O., Millikin, K.: On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion. Information Processing Letters\u00a0106(3), 100\u2013109 (2008)","journal-title":"Information Processing Letters"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-12251-4_18","volume-title":"Functional and Logic Programming","author":"O. Danvy","year":"2010","unstructured":"Danvy, O., Millikin, K., Munk, J., Zerny, I.: Defunctionalized interpreters for call-by-need evaluation. In: Blume, M., Vidal, G. (eds.) FLOPS 2010. LNCS, vol.\u00a06009, pp. 240\u2013256. Springer, Heidelberg (2010)"},{"key":"1_CR14","first-page":"162","volume-title":"Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001)","author":"O. Danvy","year":"2001","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: S\u00f8ndergaard, H. (ed.) Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), Firenze, Italy, September 2001, pp. 162\u2013174. ACM Press, New York (2001); Extended version available as the research report BRICS RS-01-23"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in reduction semantics. Research Report BRICS RS-04-26, Department of Computer Science, Aarhus University, Aarhus, Denmark, A preliminary version appeared in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, vol. 59.4 (November 2004)","DOI":"10.7146\/brics.v11i26.21851"},{"key":"1_CR16","series-title":"SIGPLAN Notices","first-page":"153","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages","author":"R. Garcia","year":"2009","unstructured":"Garcia, R., Lumsdaine, A., Sabry, A.: Lazy evaluation and delimited control. In: Pierce, B.C. (ed.) Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages, Savannah, GA, January 2009. SIGPLAN Notices, vol.\u00a044(1), pp. 153\u2013164. ACM Press, New York (2009)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BFb0017401","volume-title":"Graph Grammars and Their Application to Computer Science","author":"J.R.W. Glauert","year":"1991","unstructured":"Glauert, J.R.W., Kennaway, R., Sleep, M.R.: Dactl: An experimental graph rewriting language. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 378\u2013395. Springer, Heidelberg (1991)"},{"key":"1_CR18","first-page":"458","volume-title":"Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages","author":"J. Hatcliff","year":"1994","unstructured":"Hatcliff, J., Danvy, O.: A generic account of continuation-passing styles. In: Boehm, H.-J. (ed.) Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, January 1994, pp. 458\u2013471. ACM Press, New York (1994)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Hatcliff, J., Danvy, O.: A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 507\u2013541 (1997)","DOI":"10.1017\/S0960129597002405"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/LICS.1994.316084","volume-title":"Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science","author":"A. Jeffrey","year":"1994","unstructured":"Jeffrey, A.: A fully abstract semantics for concurrent graph reduction. In: Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, July 1994, pp. 82\u201391. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"1_CR21","series-title":"Mathematical Centre Tracts","volume-title":"Combinatory Reduction Systems","author":"J.W. Klop","year":"1980","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Mathematical Centre Tracts, vol.\u00a0127. Mathematisch Centrum, Amsterdam (1980)"},{"key":"1_CR22","unstructured":"Koopman, P.W.M.: Functional Programs as Executable Specifications. PhD thesis, University of Nijmegen, Nijmegen, The Netherlands (1990)"},{"key":"1_CR23","series-title":"SIGPLAN Notices","first-page":"188","volume-title":"Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming","author":"J.L. Lawall","year":"1997","unstructured":"Lawall, J.L., Mairson, H.G.: On global dynamics of optimal graph reduction. In: Tofte, M. (ed.) Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, Amsterdam, The Netherlands, June 1997. SIGPLAN Notices, vol.\u00a032(8), pp. 188\u2013195. ACM Press, New York (1997)"},{"issue":"3","key":"1_CR24","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. Journal of Functional Programming\u00a08(3), 275\u2013317 (1998)","journal-title":"Journal of Functional Programming"},{"issue":"6","key":"1_CR25","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1017\/S0956796809990219","volume":"19","author":"K. Nakata","year":"2009","unstructured":"Nakata, K., Hasegawa, M.: Small-step and big-step semantics for call-by-need. Journal of Functional Programming\u00a019(6), 699\u2013722 (2009)","journal-title":"Journal of Functional Programming"},{"key":"1_CR26","series-title":"Prentice Hall International Series in Computer Science","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1987)"},{"key":"1_CR27","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"M.J. Plasmeijer","year":"1993","unstructured":"Plasmeijer, M.J., van Eekelen, M.C.J.D.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading (1993)"},{"key":"1_CR28","unstructured":"Robinet, B.: Contribution \u00e0 l\u2019\u00e9tude de r\u00e9alit\u00e9s informatiques. Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Pierre et Marie Curie (Paris VI), Paris, France (May 1974)"},{"key":"1_CR29","first-page":"123","volume-title":"Machine Intelligence","author":"J.A. Robinson","year":"1969","unstructured":"Robinson, J.A.: A note on mechanizing higher order logic. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a05, pp. 123\u2013133. Edinburgh University Press, Edinburgh (1969)"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"Turner, D.A.: A new implementation technique for applicative languages. Software\u2014Practice and Experience\u00a09(1), 31\u201349 (1979)","journal-title":"Software\u2014Practice and Experience"},{"key":"1_CR31","volume-title":"Trends in Functional Programming","author":"I. Zerny","year":"2009","unstructured":"Zerny, I.: On graph rewriting, reduction and evaluation. In: Horv\u00e1th, Z., Zs\u00f3k, V., Achten, P., Koopman, P. (eds.) Trends in Functional Programming, Kom\u00e1rno, Slovakia, June 2009, vol.\u00a010, Intellect Books, Bristol (2009); Granted the best student-paper award of TFP 2009 (to appear)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20551-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T12:13:18Z","timestamp":1592482398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20551-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205507","9783642205514"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20551-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}