{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T16:20:46Z","timestamp":1697473246746},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10990-014-9103-9","type":"journal-article","created":{"date-parts":[[2015,1,3]],"date-time":"2015-01-03T14:20:47Z","timestamp":1420294847000},"page":"63-84","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On graph rewriting, reduction, and evaluation in the presence of cycles"],"prefix":"10.1007","volume":"26","author":[{"given":"Ian","family":"Zerny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,4]]},"reference":[{"key":"9103_CR1","first-page":"8","volume-title":"Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP\u201903)","author":"MS 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\u201903), pp. 8\u201319. ACM Press, Uppsala (2003)"},{"issue":"1&2","key":"9103_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","volume":"146","author":"ZM Ariola","year":"1995","unstructured":"Ariola, Z.M., Arvind, : Properties of a first-order functional language with sharing. Theor. Comput. Sci. 146(1&2), 69\u2013108 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9103_CR3","first-page":"321","volume-title":"Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, vol. B, Chap. 7","author":"HP Barendregt","year":"1990","unstructured":"Barendregt, H.P.: Functional programming and lambda calculus. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, vol. B, Chap. 7, pp. 321\u2013364. Elsevier and The MIT Press, Cambridge (1990)"},{"key":"9103_CR4","doi-asserted-by":"crossref","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, Parallel Architectures and Languages Europe, Vol. II: Parallel Languages, Number 259 in Lecture Notes in Computer Science. Springer, Eindhoven, The Netherlands, pp. 141\u2013158 (1987)","DOI":"10.1007\/3-540-17945-3_8"},{"issue":"1","key":"9103_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1297658.1297664","volume":"9","author":"M Biernacka","year":"2007","unstructured":"Biernacka, M., Danvy, O.: A concrete framework for environment machines. ACM Trans. Comput. Logic 9(1), 1\u201330 (2007)","journal-title":"ACM Trans. Comput. Logic"},{"key":"9103_CR6","doi-asserted-by":"crossref","unstructured":"Biernacka, M., Danvy, O.: Towards compatible and interderivable semantic specifications for the Scheme programming language, Part II: Reduction semantics and abstract machines. In Palsberg [35], pages 186\u2013206.","DOI":"10.1007\/978-3-642-04164-8_10"},{"key":"9103_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fclck, T., Held, A., Kluge, W.E., Pantke, S., Rathsack, C., Scholz, S.-B., Schr\u00f6der, R.: Experience with the implementation of a concurrent graph reduction system on an nCUBE\/2 platform. In: Buchberger, B., Volkert, J. (eds.) Parallel Processing: CONPAR 94\u2014VAPP VI, Number 854 in Lecture Notes in Computer Science, pp. 497\u2013508. Springer, Berlin (1994)","DOI":"10.1007\/3-540-58430-7_44"},{"key":"9103_CR8","doi-asserted-by":"crossref","unstructured":"Burn, G., Peyton Jones, S.L., Robson, J.D.: The spineless G-machine. In R.Cartwright, editor, Proceedings of the 1988 ACM Conference on Lisp and Functional Programming pp. 244\u2013258. ACM Press, Snowbird (1988)","DOI":"10.1145\/62678.62717"},{"issue":"5","key":"9103_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(82)90014-X","volume":"14","author":"FW Burton","year":"1982","unstructured":"Burton, F.W.: A linear space translation of functional programs to Turner combinators. Inf. Process. Lett. 14(5), 201\u2013204 (1982)","journal-title":"Inf. Process. Lett."},{"key":"9103_CR10","volume-title":"Combinatory Logic: Volume II","author":"HB Curry","year":"1972","unstructured":"Curry, H.B., Hindley, J.R., Feys, R.: Combinatory Logic: Volume II. North Holland, Amsterdam (1972)"},{"key":"9103_CR11","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Defunctionalized interpreters for programming languages. In P. Thiemann, (ed.) Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP\u201908), SIGPLAN Notices, Victoria, BC, ACM Press. Invited talk, 43(9),131\u2013142 (2008)","DOI":"10.1145\/1411204.1411206"},{"key":"9103_CR12","first-page":"66","volume-title":"Advanced Functional Programming, Sixth International School, Number 5382 in Lecture Notes in Computer Science","author":"O Danvy","year":"2008","unstructured":"Danvy, O.: From reduction-based to reduction-free normalization. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) Advanced Functional Programming, Sixth International School, Number 5382 in Lecture Notes in Computer Science, pp. 66\u2013164. Springer, Nijmegen (2008)"},{"key":"9103_CR13","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Towards compatible and interderivable semantic specifications for the Scheme programming language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines. In Palsberg [35], pp. 162\u2013185","DOI":"10.1007\/978-3-642-04164-8_9"},{"key":"9103_CR14","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.jcss.2009.10.004","volume":"76","author":"O Danvy","year":"2010","unstructured":"Danvy, O., Johannsen, J.: Inter-deriving semantic artifacts for object-oriented programming. J. Comput. Syst. Sci. 76, 302\u2013323 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"9103_CR15","doi-asserted-by":"crossref","unstructured":"Danvy, O., Johannsen, J., Zerny, I.: A walk in the semantic park. In: Khoo, S.-C., Siek, J. (eds.) Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2011). ACM Press, Austin. Invited talk, 1\u201312 Jan (2011)","DOI":"10.1145\/1929501.1929503"},{"issue":"3","key":"9103_CR16","doi-asserted-by":"crossref","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. Inf. Process. Lett. 106(3), 100\u2013109 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"4:12","key":"9103_CR17","first-page":"1","volume":"4","author":"O Danvy","year":"2008","unstructured":"Danvy, O., Millikin, K.: A rational deconstruction of Landin\u2019s SECD machine with the J operator. Log. Methods Comput. Sci. 4(4:12), 1\u201367 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"9103_CR18","unstructured":"Danvy, O., Millikin, K.: Refunctionalization at work Science of Computer Programming. Extended Version Available as the Research Report BRICS RS-08-04. 74(8), 534\u2013549 (2009)"},{"key":"9103_CR19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2012.02.023","volume":"435","author":"O Danvy","year":"2012","unstructured":"Danvy, O., Millikin, K., Munk, J., Zerny, I.: On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation. Theor. Comput. Sci. 435, 21\u201342 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9103_CR20","doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Defunctionalization at work. In H. S\u00f8ndergaard (ed.) Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP\u201901). ACM Press, Firenze. Extended version available as the research report BRICS RS-01-23, pp. 162\u2013174 (2001)","DOI":"10.7146\/brics.v8i23.21684"},{"key":"9103_CR21","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 (2004)","DOI":"10.7146\/brics.v11i26.21851"},{"key":"9103_CR22","doi-asserted-by":"crossref","unstructured":"Danvy, O., Zerny, I.: Three syntactic theories for combinatory graph reduction. In: Alpuente, M. (ed.) Logic Based Program Synthesis and Transformation, 20th International Symposium, LOPSTR 2010, Revised Selected Papers, Number 6564 in Lecture Notes in Computer Science, pp. 1\u201320. Invited talk, Springer, Hagenberg (2010)","DOI":"10.1007\/978-3-642-20551-4_1"},{"key":"9103_CR23","volume-title":"Semantics Engineering with PLT Redex","author":"M Felleisen","year":"2009","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex. The MIT Press, Cambridge (2009)"},{"key":"9103_CR24","doi-asserted-by":"crossref","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 and their Application to Computer Science, 4th International Workshop, Proceedings, Number 532 in Lecture Notes in Computer Science, pp. 378\u2013395. Springer, Bremen (1990)","DOI":"10.1007\/BFb0017401"},{"issue":"5","key":"9103_CR25","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G Huet","year":"1997","unstructured":"Huet, G.: The zipper. J. Funct. Progr. 7(5), 549\u2013554 (1997)","journal-title":"J. Funct. Progr."},{"key":"9103_CR26","doi-asserted-by":"crossref","unstructured":"Hughes, J.: Super combinators: a new implementation method for applicative languages. In: Friedman, D.P., Wise, D.S. (ed.) Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pp. 1\u201310. ACM Press, Pittsburgh (1982)","DOI":"10.1145\/800068.802129"},{"key":"9103_CR27","doi-asserted-by":"crossref","unstructured":"Hutton, G., Wright, J.: Calculating an Exceptional Machine. In H.-W. Loidl, (ed.) Trends in Functional Programming, vol. 5. Intellect (2006)","DOI":"10.2307\/j.ctv36xw0k5.7"},{"key":"9103_CR28","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: A fully abstract semantics for concurrent graph reduction. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pp. 82\u201391. IEEE Computer Society Press, Los Alamitos (1994)","DOI":"10.1109\/LICS.1994.316084"},{"key":"9103_CR29","doi-asserted-by":"crossref","unstructured":"Johnsson, T.: Efficient compilation of lazy evaluation. In: Graham, S.L. (ed.) Proceedings of the 1984 Symposium on Compiler Construction, SIGPLAN Notices, vol. 19, no. 6, pp. 58\u201369. ACM Press, Montr\u00e9al, Canada (1984)","DOI":"10.1145\/502949.502880"},{"key":"9103_CR30","unstructured":"Koopman, P.W.M.: Functional Programs as Executable Specifications. PhD thesis, University of Nijmegen (1990)"},{"issue":"4","key":"9103_CR31","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"PJ Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. Comput. J 6(4), 308\u2013320 (1964)","journal-title":"Comput. J"},{"issue":"3","key":"9103_CR32","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1025641323400","volume":"16","author":"H-W Loidl","year":"2003","unstructured":"Loidl, H.-W., Rubio, F., Scaife, N., Hammond, K., Horiguchi, S., Klusik, U., Loogen, R., Michaelson, G., Pena, R., Priebe, S., Portillo, \u00c1.J.R., Trinder, P.W.: Comparing parallel functional languages: programming and performance. High. Order Symbol. Comput. 16(3), 203\u2013251 (2003)","journal-title":"High. Order Symbol. Comput."},{"key":"9103_CR33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"R Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (Revised). The MIT Press, Cambridge (1997)"},{"key":"9103_CR34","doi-asserted-by":"crossref","unstructured":"Ohori, A., Sasano, I.: Lightweight fusion by fixed point promotion. In: Felleisen, M. (ed.) Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices, vol. 42, No. 1, pp. 143\u2013154. ACM Press, Nice (2007)","DOI":"10.1145\/1190216.1190241"},{"key":"9103_CR35","doi-asserted-by":"crossref","unstructured":"Palsberg, J., (ed.) Semantics and Algebraic Specification: Essays dedicated to Peter D. Mosses on the occasion of his 60th birthday, number 5700 in Lecture Notes in Computer Science. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04164-8"},{"key":"9103_CR36","volume-title":"The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science","author":"SLP Jones","year":"1987","unstructured":"Jones, S.L.P.: The Implementation of Functional Programming Languages. Prentice Hall International Series in Computer Science. Prentice-Hall International, London (1987)"},{"issue":"2","key":"9103_CR37","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"SLP Jones","year":"1992","unstructured":"Jones, S.L.P.: Implementing lazy functional languages on stock hardware: the spineless tagless G-machine. J. Funct. Progr. 2(2), 127\u2013202 (1992)","journal-title":"J. Funct. Progr."},{"key":"9103_CR38","doi-asserted-by":"crossref","unstructured":"Pirog, M., Biernacki, D.: A systematic derivation of the STG machine verified in Coq. In: Gibbons, J. (ed.) Haskell \u201910: Proceedings of the 2010 ACM SIGPLAN Haskell Symposium, pp. 25\u201336. ACM Press, Baltimore (2010)","DOI":"10.1145\/1863523.1863528"},{"key":"9103_CR39","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"MJ Plasmeijer","year":"1993","unstructured":"Plasmeijer, M.J., van Eekelen, M.C.J.D.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading (1993)"},{"key":"9103_CR40","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"GD Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the $$\\lambda $$ \u03bb -calculus. Theor. Comput. Sci. 1, 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9103_CR41","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"DA Turner","year":"1979","unstructured":"Turner, D.A.: A new implementation technique for applicative languages. Softw. Pract. Exp. 9(1), 31\u201349 (1979)","journal-title":"Softw. Pract. Exp."},{"key":"9103_CR42","doi-asserted-by":"crossref","unstructured":"van Eekelen, M., Smetsers, S., Plasmeijer, R.: Graph rewriting semantics for functional programming languages. In: Proceedings of the Fifth Annual Conference of the European Association for Computer Science Logic, pp. 106\u2013128. Springer, Berlin (1996)","DOI":"10.1007\/3-540-63172-0_35"},{"key":"9103_CR43","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics of the Lambda Calculus. PhD thesis, Programming Research Group, Oxford University (1971)"},{"key":"9103_CR44","doi-asserted-by":"crossref","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, vol. 10, pp. 81\u2013112, Kom\u00e1rno, Slovakia, Intellect Books. Best student-paper award of TFP 2009 (2009)","DOI":"10.2307\/j.ctv36xvmkd.9"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-014-9103-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-014-9103-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-014-9103-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-014-9103-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T09:58:42Z","timestamp":1690797522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-014-9103-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":44,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9103"],"URL":"https:\/\/doi.org\/10.1007\/s10990-014-9103-9","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}