{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:31:06Z","timestamp":1742967066575,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319141244"},{"type":"electronic","value":"9783319141251"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14125-1_12","type":"book-chapter","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T12:03:10Z","timestamp":1418212990000},"page":"202-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compiling a Functional Logic Language: The Fair Scheme"],"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":[[2014,12,11]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.jsc.2004.01.001","volume":"40","author":"E Albert","year":"2005","unstructured":"Albert, E., Hanus, M., Huch, F., Oliver, J., Vidal, G.: Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation 40(1), 795\u2013829 (2005)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR2","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.) Algebraic and Logic Programming. LNCS, vol. 632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"12_CR3","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. 1298, pp. 16\u201330. Springer, Heidelberg (1997). Extended version at http:\/\/cs.pdx.edu\/\u00a0antoy\/homepage\/publications\/alp97\/full.pdf"},{"key":"12_CR4","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), pp. 199\u2013206. ACM, Florence, Italy (September 2001)","DOI":"10.1145\/773184.773205"},{"issue":"1","key":"12_CR5","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 40(1), 875\u2013903 (2005)","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"12_CR6","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 45(5), 501\u2013522 (2010)","journal-title":"Journal of Symbolic Computation"},{"issue":"4\u20135","key":"12_CR7","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":"12_CR8","doi-asserted-by":"crossref","unstructured":"Antoy, S., Brown, D., Chiang, S.: Lazy context cloning for non-deterministic graph rewriting. In: Proc. of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006, Vienna, Austria, pp. 61\u201370 (April 2006)","DOI":"10.1016\/j.entcs.2006.10.026"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11805618_4","volume-title":"Term Rewriting and Applications","author":"S Antoy","year":"2006","unstructured":"Antoy, S., Brown, D.W., Chiang, S.-H.: On the correctness of bubbling. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 35\u201349. Springer, Heidelberg (2006)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45788-7_4","volume-title":"Functional and Logic Programming","author":"S Antoy","year":"2002","unstructured":"Antoy, S., Hanus, M.: Functional logic design patterns. In: Hu, Z., Rodr\u00edguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol. 2441, pp. 67\u201387. Springer, Heidelberg (2002)"},{"key":"12_CR11","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)"},{"key":"12_CR12","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":"12_CR13","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 53(4), 74\u201385 (2010)","journal-title":"Comm. of the ACM"},{"key":"12_CR14","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. 3474, pp. 108\u2013125. Springer, Heidelberg (2005)"},{"key":"12_CR15","unstructured":"Antoy, S., Jost, A.: Compiling a functional logic language: The fair scheme. In: 23rd Int\u2019nl Symp. on Logic-based Program Synthesis and Transformation (LOPSTR 2013), pp. 129\u2013143. Dpto. de Systems Informaticos y Computation, Universidad Complutense de Madrid, TR-11-13, Madrid, Spain (Sept. 2013). Extended version available at http:\/\/web.cecs.pdx.edu\/~antoy\/homepage\/publications\/lopstr13\/long.pdf"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"12_CR17","unstructured":"Brassel, B.: Implementing Functional Logic Programs by Translation into Purely Functional Programs. PhD thesis, Christian-Albrechts-Universit\u00e4t zu Kiel (2011)"},{"key":"12_CR18","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)"},{"key":"12_CR19","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 Brassel","year":"2007","unstructured":"Brassel, 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)"},{"key":"12_CR20","unstructured":"Brassel, B., Huch, F.: The Kiel Curry System KiCS. In: Seipel, D., Hanus, M. (eds.) Preproceedings of the 21st Workshop on (Constraint) Logic Programming (WLP 2007), W\u00fcurzburg, Germany, pp. 215\u2013223 (October 2007). Technical report 434"},{"key":"12_CR21","unstructured":"Caballero, R., S\u00e1nchez, J. (eds.) TOY: A Multiparadigm Declarative Language (version 2.3.1) (2007). http:\/\/toy.sourceforge.net"},{"key":"12_CR22","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"},{"issue":"4\u20135","key":"12_CR23","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. 21(4\u20135), 413\u2013465 (2011)","journal-title":"J. Funct. Program."},{"key":"12_CR24","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. 1295, pp. 249\u2013258. Springer, Heidelberg (1997)"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"JC 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 40, 47\u201387 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"12_CR26","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. 1048, pp. 252\u2013266. Springer, Heidelberg (1996)"},{"key":"12_CR27","unstructured":"Hanus, M. (ed.) Curry: An Integrated Functional Logic Language (Vers. 0.8.2) (2006). http:\/\/www-ps.informatik.uni-kiel.de\/currywiki\/"},{"key":"12_CR28","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. 4670, pp. 45\u201375. Springer, Heidelberg (2007)"},{"key":"12_CR29","unstructured":"Hanus, M. (ed.) PAKCS 1.9.1: The Portland Aachen Kiel Curry System (2008). http:\/\/www.informatik.uni-kiel.de\/~pakcs"},{"key":"12_CR30","unstructured":"Hanus, M., Kuchen, H., Moreno-Navarro, J.J.: Curry: A truly functional logic language. In: Proceedings of the ILPS 1995 Workshop on Visions for the Future of Logic Programming, Portland, Oregon, pp. 95\u2013107 (1995)"},{"issue":"Special Issue 1","key":"12_CR31","first-page":"1","volume":"1999","author":"M Hanus","year":"1999","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)","journal-title":"Journal of Functional and Logic Programming"},{"key":"12_CR32","volume-title":"Computational Logic: Essays in Honour of Alan Robinson","author":"G Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in orthogonal term rewriting systems. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic: Essays in Honour of Alan Robinson. MIT Press, Cambridge, MA (1991)"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0743-1066(92)90026-Y","volume":"12","author":"H Hussmann","year":"1992","unstructured":"Hussmann, H.: Nondeterministic algebraic specifications and nonconfluent rewriting. Journal of Logic Programming 12, 237\u2013255 (1992)","journal-title":"Journal of Logic Programming"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-15975-4_37","volume-title":"Functional Programming Languages and Computer Architecture","author":"T Johnsson","year":"1985","unstructured":"Johnsson, T.: Lambda lifting: Transforming programs to recursive equations. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol. 201, pp. 190\u2013203. Springer, Heidelberg (1985)"},{"key":"12_CR35","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":"12_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2007.05.042","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":"12_CR37","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., Martin-Martin, E., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: Rewriting and narrowing for constructor systems with call-time choice semantics. In: Theory and Practice of Logic Programming, pp. 1\u201349 (2012)","DOI":"10.1017\/S1471068412000373"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A simple rewrite notion for call-time choice semantics. In: PPDP 2007: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, pp. 197\u2013208. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1273920.1273947"},{"key":"12_CR39","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":"FJL Fraguas","year":"1999","unstructured":"Fraguas, F.J.L., Hern\u00e1ndez, J.S.: TOY: A multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244\u2013247. Springer, Heidelberg (1999)"},{"key":"12_CR40","unstructured":"Lux, W. (ed.) The M\u00fcnster Curry Compiler (2012). http:\/\/danae.uni-muenster.de\/~lux\/curry\/"},{"key":"12_CR41","first-page":"441","volume":"10","author":"DHD Warren","year":"1982","unstructured":"Warren, D.H.D.: Higher-order extensions to PROLOG: are they needed? Machine Intelligence 10, 441\u2013454 (1982)","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14125-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T05:12:30Z","timestamp":1676005950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-14125-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319141244","9783319141251"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14125-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}