{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:01:14Z","timestamp":1743116474118,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319178219"},{"type":"electronic","value":"9783319178226"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17822-6_17","type":"book-chapter","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T05:57:31Z","timestamp":1429682251000},"page":"299-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Declarative Compilation for Constraint Logic Programming"],"prefix":"10.1007","author":[{"given":"Emilio Jes\u00fas Gallego","family":"Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"Mari\u00f1o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Amato, G., Lipton, J., McGrail, R.: On the algebraic structure of declarative programming languages. Theor. Comput. Sci. 410(46), 4626\u20134671 (2009), http:\/\/www.sciencedirect.com\/science\/article\/B6V1G-4WV15VS-7\/2\/5475111b9a9642244a208e9bd1fcd46a (abstract Interpretation and Logic Programming: In honor of professor Giorgio Levi)","key":"17_CR1","DOI":"10.1016\/j.tcs.2009.07.038"},{"unstructured":"Asperti, A., Martini, S.: Projections instead of variables: a category theoretic interpretation of logic programs. In: ICLP, pp. 337\u2013352 (1989)","key":"17_CR2"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(93)90170-X","volume":"107","author":"M Bellia","year":"1993","unstructured":"Bellia, M., Occhiuto, M.E.: C-expressions: a variable-free calculus for equational logic programming. Theor. Comput. Sci. 107(2), 209\u2013252 (1993)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Broome, P., Lipton, J.: Combinatory logic programming: computing in relation calculi. In: ILPS\u201994: Proceedings of the 1994 International Symposium on Logic programming, pp. 269\u2013285. MIT Press, Cambridge (1994)","key":"17_CR4"},{"doi-asserted-by":"crossref","unstructured":"Cheney, J., Urban, C.: Alpha-prolog: a logic programming language with names, binding, and alpha-equivalence (2004)","key":"17_CR5","DOI":"10.1007\/978-3-540-27775-0_19"},{"doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press (1977)","key":"17_CR6","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/inco.2000.3024","volume":"169","author":"M Comini","year":"2001","unstructured":"Comini, M., Levi, G., Meo, M.C.: A theory of observables for logic programs. Inf. Comput. 169(1), 23\u201380 (2001)","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"17_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(01)00308-5","volume":"300","author":"SE Finkelstein","year":"2003","unstructured":"Finkelstein, S.E., Freyd, P.J., Lipton, J.: A new framework for declarative programming. Theor. Comput. Sci. 300(1\u20133), 91\u2013160 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR9","volume-title":"Categories, Allegories","author":"P Freyd","year":"1991","unstructured":"Freyd, P., Scedrov, A.: Categories, Allegories. North Holland Publishing Company, Amsterdam (1991)"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1093\/jigpal\/jzq011","volume":"19","author":"EJ Gallego Arias","year":"2011","unstructured":"Gallego Arias, E.J., Lipton, J., Mari\u00f1o, J., Nogueira, P.: First-order unification using variable-free relational algebra. Log. J. IGPL 19(6), 790\u2013820 (2011). http:\/\/jigpal.oxfordjournals.org\/content\/19\/6\/790.abstract","journal-title":"Log. J. IGPL"},{"unstructured":"Gallego Arias, E.J., Lipton, J.: Logic programming in tabular allegories. In: Dovier, A., Costa, V.S. (eds.) Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4\u20138, 2012, Budapest, Hungary. LIPIcs, vol. 17, pp. 334\u2013347. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik (2012)","key":"17_CR11"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. J. Log. Program. 19\/20, 503\u2013581 (1994). http:\/\/citeseer.ist.psu.edu\/jaffar94constraint.html","journal-title":"J. Log. Program."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-60983-0_12","volume-title":"Extensions of Logic Programming","author":"Y Kinoshita","year":"1996","unstructured":"Kinoshita, Y., Power, A.J.: A fibrational semantics for logic programs. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds.) ELP. LNCS, vol. 1050, pp. 177\u2013191. Springer, Heidelberg (1996)"},{"unstructured":"Komendantskaya, E., Power, J.: Coalgebraic derivations in logic programming. In: Bezem, M. (ed.) CSL. LIPIcs, vol. 12, pp. 352\u2013366. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik (2011)","key":"17_CR14"},{"unstructured":"Lipton, J., Chapman, E.: Some notes on logic programming with a relational machine. In: Jaoua, A., Kempf, P., Schmidt, G. (eds.) Using Relational Methods in Computer Science, pp. 1\u201334. Technical report Nr. 1998-03, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen, July 1998","key":"17_CR15"},{"key":"17_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, New York (1984)"},{"issue":"1\u20132","key":"17_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Log. 51(1\u20132), 125\u2013157 (1991)","journal-title":"Ann. Pure Appl. Log."},{"doi-asserted-by":"crossref","unstructured":"Pfenning, F., Elliot, C.: Higher-order abstract syntax. In: PLDI\u201988: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, pp. 199\u2013208. ACM, New York (1988)","key":"17_CR18","DOI":"10.1145\/53990.54010"},{"doi-asserted-by":"crossref","unstructured":"Rydeheard, D.E., Burstall, R.M.: A categorical unification algorithm. In: Proceedings of a Tutorial and Workshop on Category Theory and Computer Programming, pp. 493\u2013505. Springer, New York (1986)","key":"17_CR19","DOI":"10.1007\/3-540-17162-2_139"},{"key":"17_CR20","volume-title":"The Art of Prolog","author":"L Sterling","year":"1986","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog. The MIT Press, Cambridge (1986)"},{"key":"17_CR21","volume-title":"A Formalization of Set Theory Without Variables, Colloquium Publications","author":"A Tarski","year":"1987","unstructured":"Tarski, A., Givant, S.: A Formalization of Set Theory Without Variables, Colloquium Publications, vol. 41. American Mathematical Society, Providence (1987)"},{"issue":"1\u20133","key":"17_CR22","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theor. Comput. Sci. 323(1\u20133), 473\u2013497 (2004)","journal-title":"Theor. Comput. Sci."}],"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-17822-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:19:06Z","timestamp":1675851546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17822-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319178219","9783319178226"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17822-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}