{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T21:24:30Z","timestamp":1782422670407,"version":"3.54.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319631387","type":"print"},{"value":"9783319631394","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_6","type":"book-chapter","created":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T23:22:55Z","timestamp":1500852175000},"page":"97-113","source":"Crossref","is-referenced-by-count":9,"title":["A New Functional-Logic Compiler for Curry: Sprite"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andy","family":"Jost","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"6_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. 632, pp. 143\u2013157. Springer, Heidelberg (1992). doi:\n10.1007\/BFb0013825"},{"issue":"4\u20135","key":"6_CR2","first-page":"713","volume":"11","author":"S Antoy","year":"2011","unstructured":"Antoy, S.: On the correctness of pull-tabbing. TPLP 11(4\u20135), 713\u2013730 (2011)","journal-title":"TPLP"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11680093_2","volume-title":"Logic Based Program Synthesis and Transformation","author":"S Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Declarative programming with function patterns. In: Hill, P.M. (ed.) LOPSTR 2005. LNCS, vol. 3901, pp. 6\u201322. Springer, Heidelberg (2006). doi:\n10.1007\/11680093_2"},{"key":"6_CR4","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. 4079, pp. 87\u2013101. Springer, Heidelberg (2006). doi:\n10.1007\/11799573_9"},{"issue":"4","key":"6_CR5","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. Commun. ACM 53(4), 74\u201385 (2010)","journal-title":"Commun. ACM"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Antoy, S., Johannsen, J., Libby, S.: Needed computations shortcutting needed steps. In: Middeldorp, A., van Raamsdonk, F. (eds.) Proceedings 8th International Workshop on Computing with Terms and Graphs, Vienna, 13 July 2014. Electronic Proceedings in Theoretical Computer Science, vol. 183, pp. 18\u201332. Open Publishing Association (2015)","DOI":"10.4204\/EPTCS.183.2"},{"key":"6_CR7","unstructured":"Antoy, S., Jost, A.: Compiling a functional logic language: the fair scheme. In: 23rd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2013), Madrid, pp. 129\u2013143. Dpto. de Systems Informaticos y Computation, Universidad Complutense de Madrid, TR-11-13, September 2013"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22531-4_1","volume-title":"Functional and Constraint Logic Programming","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. 6816, pp. 1\u201318. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-22531-4_1"},{"key":"6_CR9","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. 4807, pp. 122\u2013138. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-76637-7_9"},{"key":"6_CR10","unstructured":"Caballero, R., S\u00e1nchez, J. (eds.): TOY: a multiparadigm declarative language (version 2.3.1) (2007). \nhttp:\/\/toy.sourceforge.net"},{"key":"6_CR11","unstructured":"Clang: a C language family frontend for LLVM (2016). \nhttp:\/\/www.clang.llvm.org\/"},{"key":"6_CR12","unstructured":"Echahed, R., Janodet, J.C.: On constructor-based graph rewriting systems. Technical report 985-I, IMAG (1997). \nftp:\/\/ftp.imag.fr\/pub\/labo-LEIBNIZ\/OLD-archives\/PMP\/c-graph-rewriting.ps.gz"},{"key":"6_CR13","unstructured":"The Glasgow Haskell Compiler (2013). \nhttp:\/\/www.haskell.org\/ghc\/"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Jones, S.L.P.: A short cut to deforestation. In: Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232. ACM (1993)","DOI":"10.1145\/165180.165214"},{"issue":"1","key":"6_CR15","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":"6_CR16","unstructured":"Hanus, M. (ed.): Curry: an integrated functional logic language (Vers. 0.8.2) (2006). \nhttp:\/\/www-ps.informatik.uni-kiel.de\/currywiki\/"},{"key":"6_CR17","unstructured":"Hanus, M.: Flatcurry: an intermediate representation for Curry programs (2008). \nhttp:\/\/www.informatik.uni-kiel.de\/curry\/flat\/"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-37651-1_6","volume-title":"Programming Logics - Essays in Memory of Harald Ganzinger","author":"M Hanus","year":"2013","unstructured":"Hanus, M.: Functional logic programming: from theory to Curry. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics - Essays in Memory of Harald Ganzinger. LNCS, vol. 7797, pp. 123\u2013168. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-37651-1_6"},{"key":"6_CR19","unstructured":"Hanus, M. (ed.): PAKCS 1.11.4: The Portland Aachen Kiel Curry system (2014). \nhttp:\/\/www.informatik.uni-kiel.de\/pakcs"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-61055-3_27","volume-title":"Programming Languages and Systems \u2014 ESOP \u201996","author":"SLP Jones","year":"1996","unstructured":"Jones, S.L.P.: Compiling Haskell by program transformation: a report from the trenches. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol. 1058, pp. 18\u201344. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-61055-3_27"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-1-4471-3573-9_13","volume-title":"Functional Programming","author":"SP Jones","year":"1995","unstructured":"Jones, S.P., Santos, A.: Compilation by transformation in the Glasgow Haskell compiler. In: Hammond, K., Turner, D.N., Sansom, P.M. (eds.) Glasgow 1994, pp. 184\u2013204. Springer, London (1995). doi:\n10.1007\/978-1-4471-3573-9_13"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis and transformation. In: Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization (CGO 2004), San Jose, pp. 75\u201388, March 2004","DOI":"10.1109\/CGO.2004.1281665"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.entcs.2006.05.049","volume":"188","author":"FJ 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. 188, 3\u201319 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"FJ L\u00f3pez Fraguas","year":"1999","unstructured":"L\u00f3pez Fraguas, F.J., S\u00e1nchez Hern\u00e1ndez, J.: TOY: a multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244\u2013247. Springer, Heidelberg (1999). doi:\n10.1007\/3-540-48685-2_19"},{"key":"6_CR25","unstructured":"Lux, W. (ed.): The Muenster Curry compiler (2012). \nhttp:\/\/danae.uni-muenster.de\/lux\/curry\/"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Marlow, S., Jones, S.P.: Making a fast Curry: push\/enter vs. eval\/apply for higher-order languages. In: Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming (ICFP 2004), New York, pp. 4\u201315. ACM (2004)","DOI":"10.1145\/1016850.1016856"},{"key":"6_CR27","first-page":"195","volume-title":"Functional Programming","author":"W Partain","year":"1993","unstructured":"Partain, W.: The nofib benchmark suite of Haskell programs. In: Launchbury, J., Sansom, P. (eds.) Glasgow 1992, pp. 195\u2013202. Springer, London (1993)"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Jones, S.L.P., Salkild, J.: The spineless tagless G-machine. In: Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pp. 184\u2013201. ACM (1989)","DOI":"10.1145\/99370.99385"}],"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-63139-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T23:25:07Z","timestamp":1500852307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}