{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:56:09Z","timestamp":1725684969383},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_5","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T09:21:09Z","timestamp":1337505669000},"page":"17-31","source":"Crossref","is-referenced-by-count":4,"title":["Compiling a Functional Logic Language: The Basic Scheme"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[]},{"given":"Arthur","family":"Peters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","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.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0027000","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.\u00a01298, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proc. of the 3rd International Conference on Principles and Practice of Declarative Programming (PPDP 2001), Florence, Italy, pp. 199\u2013206. ACM (September 2001)","DOI":"10.1145\/773184.773205"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","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. Journal of Symbolic Computation\u00a040(1), 875\u2013903 (2005)","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.jsc.2010.01.006","volume":"45","author":"S. Antoy","year":"2010","unstructured":"Antoy, S.: Programming with narrowing. Journal of Symbolic Computation\u00a045(5), 501\u2013522 (2010)","journal-title":"Journal of Symbolic Computation"},{"issue":"4-5","key":"5_CR6","first-page":"713","volume":"11","author":"S. Antoy","year":"2011","unstructured":"Antoy, S.: On the correctness of pull-tabbing. TPLP\u00a011(4-5), 713\u2013730 (2011)","journal-title":"TPLP"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S. Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping Rules and Logic Variables in Functional Logic Programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 87\u2013101. Springer, Heidelberg (2006)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Antoy, S., Hanus, M.: Set functions for functional logic programming. In: Proceedings of the 11th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2009), Lisbon, Portugal, pp. 73\u201382 (September 2009)","DOI":"10.1145\/1599410.1599420"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S. Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Comm. of the ACM\u00a053(4), 74\u201385 (2010)","journal-title":"Comm. of the ACM"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/11431664_7","volume-title":"Implementation and Application of Functional Languages","author":"S. Antoy","year":"2005","unstructured":"Antoy, S., Hanus, M., Liu, J., Tolmach, A.: A Virtual Machine for Functional Logic Computations. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds.) IFL 2004. LNCS, vol.\u00a03474, pp. 108\u2013125. Springer, Heidelberg (2005)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Brassel, B.: Implementing Functional Logic Programs by Translation into Purely Functional Programs. PhD thesis, Christian-Albrechts-Universit\u00e4t zu Kiel (2011)","DOI":"10.1007\/978-3-642-24452-0_2"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.entcs.2008.06.037","volume":"216","author":"B. Bra\u00dfel","year":"2008","unstructured":"Bra\u00dfel, B., Fischer, S., Huch, F.: Declaring Numbers. Electron. Notes Theor. Comput. Sci.\u00a0216, 111\u2013124 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"WFLP 2011","author":"B. Bra\u00dfel","year":"2011","unstructured":"Bra\u00dfel, B., Hanus, M., Peem\u00f6ller, B., Reck, F.: KiCS2: A New Compiler from Curry to Haskell. In: Kuchen, H. (ed.) WFLP 2011. LNCS, vol.\u00a06816, pp. 1\u201318. Springer, Heidelberg (2011)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-76637-7_9","volume-title":"Programming Languages and Systems","author":"B. Bra\u00dfel","year":"2007","unstructured":"Bra\u00dfel, B., Huch, F.: On a Tighter Integration of Functional and Logic Programming. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 122\u2013138. Springer, Heidelberg (2007)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-00675-3_13","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"B. Bra\u00dfel","year":"2009","unstructured":"Bra\u00dfel, B., Huch, F.: The Kiel Curry System KiCS. In: Seipel, D., Hanus, M., Wolf, A. (eds.) INAP\/WLP 2007. LNCS, vol.\u00a05437, pp. 195\u2013205. Springer, Heidelberg (2009)"},{"key":"5_CR16","unstructured":"Caballero, R., S\u00e1nchez, J. (eds.): TOY: A Multiparadigm Declarative Language, version 2.3.1 (2007), \n                  \n                    http:\/\/toy.sourceforge.net"},{"key":"5_CR17","unstructured":"Echahed, R., Janodet, J.C.: On constructor-based graph rewriting systems. Technical Report 985-I, IMAG (1997), \n                  \n                    ftp:\/\/ftp.imag.fr\/pub\/labo-LEIBNIZ\/OLD-archives\/PMP\/c-graph-rewriting.ps.gz"},{"key":"5_CR18","unstructured":"Echahed, R., Janodet, J.C.: Admissible graph rewriting and narrowing. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, Manchester, pp. 325\u2013340. MIT Press (June 1998)"},{"issue":"4-5","key":"5_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1017\/S0956796811000189","volume":"21","author":"S. Fischer","year":"2011","unstructured":"Fischer, S., Kiselyov, O., Chieh Shan, C.: Purely functional lazy nondeterministic programming. J. Funct. Program.\u00a021(4-5), 413\u2013465 (2011)","journal-title":"J. Funct. Program."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0029968","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\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 249\u2013258. Springer, Heidelberg (1997)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. Gonz\u00e1lez Moreno","year":"1999","unstructured":"Gonz\u00e1lez Moreno, J.C., L\u00f3pez Fraguas, F.J., Hortal\u00e1 Gonz\u00e1lez, M.T., Rodr\u00edguez Artalejo, M.: An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming\u00a040, 47\u201387 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"5_CR22","doi-asserted-by":"publisher","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. Journal of Logic Programming\u00a019&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-60939-3_19","volume-title":"Logic Program Synthesis and Transformation","author":"M. Hanus","year":"1996","unstructured":"Hanus, M.: Efficient Translation of Lazy Functional Logic Programs into Prolog. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 252\u2013266. Springer, Heidelberg (1996)"},{"key":"5_CR24","unstructured":"Hanus, M.: Functional logic programming: From theory to Curry. Technical report, Christian-Albrechts-Universit\u00e4t Kiel (2005), \n                  \n                    http:\/\/www.informatik.uni-kiel.de\/~mh\/publications\/reports\/"},{"key":"5_CR25","unstructured":"Hanus, M. (ed.): Curry: An Integrated Functional Logic Language, Vers. 0.8.2 (2006), \n                  \n                    http:\/\/www-ps.informatik.uni-kiel.de\/currywiki\/"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-74610-2_5","volume-title":"Logic Programming","author":"M. Hanus","year":"2007","unstructured":"Hanus, M.: Multi-paradigm Declarative Languages. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 45\u201375. Springer, Heidelberg (2007)"},{"key":"5_CR27","unstructured":"Hanus, M.: Flatcurry: An intermediate representation for Curry programs (2008), \n                  \n                    http:\/\/www.informatik.uni-kiel.de\/~curry\/flat\/"},{"key":"5_CR28","unstructured":"Hanus, M. (ed.): PAKCS 1.9.1: The Portland Aachen Kiel Curry System (2008), \n                  \n                    http:\/\/www.informatik.uni-kiel.de\/~pakcs"},{"key":"5_CR29","unstructured":"Hanus, M.: KiCS2 benchmarks (2011), \n                  \n                    http:\/\/www-ps.informatik.uni-kiel.de\/kics2\/benchmarks\/"},{"key":"5_CR30","unstructured":"Hanus, M., Sadre, R.: An abstract machine for Curry and its concurrent implementation in Java. Journal of Functional and Logic Programming 1999(Special Issue 1), 1\u201345 (1999)"},{"key":"5_CR31","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":"5_CR32","first-page":"157","volume-title":"Term Graph Rewriting Theory and Practice","author":"J.R. 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)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-77294-1_3","volume":"188","author":"F.J. L\u00f3pez-Fraguas","year":"2007","unstructured":"L\u00f3pez-Fraguas, F.J., de Dios-Castro, J.: Extra variables can be eliminated from functional logic programs. Electron. Notes Theor. Comput. Sci.\u00a0188, 3\u201319 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"5_CR34","unstructured":"Lux, W.: An abstract machine for the efficient implementation of Curry. In: Kuchen, H. (ed.) Workshop on Functional and Logic Programming, Arbeitsbericht No.\u00a063. Institut f\u00fcr Wirtschaftsinformatik, Universit\u00e4t M\u00fcnster (1998)"},{"key":"5_CR35","unstructured":"Ocaml (2004), \n                  \n                    http:\/\/caml.inria.fr\/ocaml\/index.en.html"},{"key":"5_CR36","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":"5_CR37","first-page":"441","volume":"10","author":"D.H.D. Warren","year":"1982","unstructured":"Warren, D.H.D.: Higher-order extensions to PROLOG: are they needed? Machine Intelligence\u00a010, 441\u2013454 (1982)","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:17:32Z","timestamp":1620112652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}