{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:58:23Z","timestamp":1725843503852},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319274355"},{"type":"electronic","value":"9783319274362"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27436-2_4","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T07:06:46Z","timestamp":1450249606000},"page":"57-72","source":"Crossref","is-referenced-by-count":0,"title":["Compiling Collapsing Rules in Certain Constructor Systems"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Jost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,17]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M Alpuente","year":"1998","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Partial evaluation of functional logic programs. ACM Trans. Program. Lang. Syst. 20(4), 768\u2013844 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Algebraic and Logic Programming","author":"S Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632. Springer, Heidelberg (1992)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Algebraic and Logic Programming","author":"S Antoy","year":"1997","unstructured":"Antoy, S.: Optimal non-deterministic functional logic computations. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol. 1298. Springer, Heidelberg (1997). http:\/\/cs.pdx.edu\/antoy\/homepage\/publications\/alp97\/full.pdf"},{"issue":"1","key":"4_CR4","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.jsc.2004.12.007","volume":"40","author":"S Antoy","year":"2005","unstructured":"Antoy, S.: Evaluation strategies for functional logic programming. J. Symb. Comput. 40(1), 875\u2013903 (2005)","journal-title":"J. Symb. Comput."},{"issue":"5","key":"4_CR5","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.jsc.2010.01.006","volume":"45","author":"S Antoy","year":"2010","unstructured":"Antoy, S.: Programming with narrowing. J. Symb. Comput. 45(5), 501\u2013522 (2010)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"4_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Comm. ACM 53(4), 74\u201385 (2010)","journal-title":"Comm. ACM"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Antoy, S., Jost, A.: Are needed redexes really needed? In: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013, pp. 61\u201371. ACM, New York (2013)","DOI":"10.1145\/2505879.2505881"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-29822-6_5","volume-title":"Functional and Logic Programming","author":"S Antoy","year":"2012","unstructured":"Antoy, S., Peters, A.: Compiling a functional logic language: The Basic Scheme. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol. 7294, pp. 17\u201331. Springer, Heidelberg (2012)"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"ZM Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundam. Inf. 26, 207\u2013240 (1996)","journal-title":"Fundam. Inf."},{"issue":"12","key":"4_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1999.2824","volume":"156","author":"ZM Ariola","year":"2000","unstructured":"Ariola, Z.M., Klop, J.W., Plump, D.: Bisimilarity in term graph rewriting. Inf. Comput. 156(12), 2\u201324 (2000)","journal-title":"Inf. Comput."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"HP Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R.: Term graph rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol. 259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"4_CR12","volume-title":"Term Rewriting Systems","author":"M Bezem","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R.: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Clarke, T.J.W., Gladstone, P.J.S., MacLean, C.D., Norman, A.C.: Skim - the s, k, i reduction machine. In: Proceedings of the 1980 ACM Conference on LISP and Functional Programming, LFP 1980, pp. 128\u2013135. ACM, New York (1980)","DOI":"10.1145\/800087.802798"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformations","author":"R Echahed","year":"2008","unstructured":"Echahed, R.: Inductively sequential term-graph rewrite systems. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214. Springer, Heidelberg (2008)"},{"key":"4_CR15","unstructured":"Echahed, R., Janodet, J.C.: On constructor-based graph rewriting systems. Technical Report 985-I, IMAG (1997). ftp:\/\/ftp.imag.fr\/pub\/labo-LEIBNIZ\/OLD-archives\/PMP\/c-graph-rewriting.ps.gz"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1997","author":"W Fokkink","year":"1997","unstructured":"Fokkink, W., van de Pol, J.: Simulation as a correct transformation of rewrite systems. In: Privara, I., Ru\u017eicka, P. (eds.) MFCS 1997. LNCS, vol. 1295. Springer, Heidelberg (1997)"},{"issue":"1","key":"4_CR17","first-page":"85","volume":"5","author":"JRW Glauert","year":"1997","unstructured":"Glauert, J.R.W., Kennaway, R., Papadopoulos, G.A., Sleep, M.R.: Dactl: an experimental graph rewriting language. J. Prog. Lang. 5(1), 85\u2013108 (1997)","journal-title":"J. Prog. Lang."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M Hanus","year":"1994","unstructured":"Hanus, M.: The integration of functions into logic programming: from theory to practice. J. Log. Program. 19&20, 583\u2013628 (1994)","journal-title":"J. Log. Program."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-37651-1_6","volume-title":"Programming Logics","author":"M Hanus","year":"2013","unstructured":"Hanus, M.: Functional logic programming: from theory to curry. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 123\u2013168. Springer, Heidelberg (2013)"},{"key":"4_CR20","unstructured":"Hanus, M.: PAKCS 1.11.4: The Portland Aachen Kiel Curry System (2014). http:\/\/www.informatik.uni-kiel.de\/pakcs"},{"key":"4_CR21","first-page":"395","volume-title":"Computational logic.: Essays Honour Alan Robinson","author":"G Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in orthogonal term rewriting systems, I. In: Lassez, J.-L., Plotkin, G. (eds.) Computational logic.: Essays Honour Alan Robinson, pp. 395\u2013414. MIT Press, Cambridge (1991)"},{"key":"4_CR22","unstructured":"Kamperman, J.F.T., Walters, H.R.: Simulating TRSs by minimal TRSs a simple, efficient, and correct compilation technique. Technical report CS-R9605, CWI (1996)"},{"key":"4_CR23","first-page":"157","volume-title":"Term Graph Rewriting Theory and Practice","author":"JR Kennaway","year":"1993","unstructured":"Kennaway, J.R., Klop, J.K., Sleep, M.R., de Vries, F.J.: The adequacy of term graph rewriting for simulating term rewriting. In: Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.J.D. (eds.) Term Graph Rewriting Theory and Practice, pp. 157\u2013169. J. Wiley & Sons, Chichester (1993)"},{"issue":"4","key":"4_CR24","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."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Plump, D.: Term graph rewriting. In: Kreowski, H.-J., Ehrig, H., Engels, G., Rozenberg, G., (eds.) Handbook of Graph Grammars, vol. 2, pp. 3\u201361. World Scientific (1999)","DOI":"10.1142\/9789812815149_0001"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S1571-0661(04)80210-X","volume":"51","author":"D Plump","year":"2001","unstructured":"Plump, D.: Essentials of term graph rewriting. Electr. Notes Theor. Comput. Sci. 51, 277\u2013289 (2001)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"volume-title":"Term Graph Rewriting Theory and Practice","year":"1993","key":"4_CR27","unstructured":"Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.J.D. (eds.): Term Graph Rewriting Theory and Practice. J. Wiley & Sons, Chichester (1993)"}],"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-319-27436-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T19:23:43Z","timestamp":1599938623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27436-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319274355","9783319274362"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27436-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}