乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:47:36Z","timestamp":1649177256943},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Wesleyan University Research Grant"},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"crossref","award":["S2013\/ICE-2731"],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"crossref"}]},{"name":"MINECO","award":["TIN2012-39391-C04-03 (StrongSoft)"]},{"name":"ANR","award":["Feever"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2017,1]]},"abstract":"Abstract<\/jats:title>\n We present a declarative framework for the compilation of constraint logic programs into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Logic variables, unification, and renaming apart are completely elided in favor of manipulation of variable-free relation expressions. In this setting, term rewriting not only provides an operational semantics for logic programs, but also a simple framework for reasoning about program execution. We prove the translation sound, and the rewriting system complete with respect to traditional SLD semantics.<\/jats:p>","DOI":"10.1007\/s00165-016-0369-z","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T09:28:30Z","timestamp":1460626110000},"page":"97-124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constraint logic programming with a relational machine"],"prefix":"10.1145","volume":"29","author":[{"given":"Emilio Jes\u00fas","family":"Gallego Arias","sequence":"first","affiliation":[{"name":"CRI, Mines ParisTech, 35 rue St Honor\u00e9, Fontainebleau, Seine-et-Marne, France"}]},{"given":"James","family":"Lipton","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Wesleyan University, 06459, MiddleTown, CT, USA"}]},{"given":"Julio","family":"Mari\u00f1o","sequence":"additional","affiliation":[{"name":"ETSI Inform\u00e1ticos, Universidad Polit\u00e9cnica de Madrid, Campus de Montegancedo s\/n, 28660, Boadilla del Monte, Spain"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Amato G Lipton J McGrail R (2009) On the algebraic structure of declarative programming languages. Theor Comput Sci 410(46):4626\u20134671. (Abstract of professor Giorgio Levi)","DOI":"10.1016\/j.tcs.2009.07.038"},{"key":"e_1_2_1_2_2_2","unstructured":"Asperti A Martini S (1989) Projections instead of variables: a category theoretic interpretation of logic programs. In: ICLP pp 337\u2013352"},{"key":"e_1_2_1_2_3_2","unstructured":"Broome P Lipton J (1994) Combinatory logic programming: computing in relation calculi. In: Proceedings of the 1994 international symposium on logic programming (ILPS\u201994). MIT Press Cambridge pp 269\u2013285"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90170-X"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"crossref","unstructured":"Clark KL (1977) Negation as failure. In: Gallaire H Minker J (eds) Logic and data bases. Plenum Press New York pp 293\u2013322","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Cheney J Urban C (2004) Alpha-Prolog: A logic programming language with names binding and alpha-equivalence. In:\nDemoen B Lifschitz V(eds) Proceedings of the 20th Conference on Logic Programming ICLP2004. Lecture Notes in Computer Science vol 3132. Springer New York pp 269\u2013283","DOI":"10.1007\/978-3-540-27775-0_19"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00308-5"},{"key":"e_1_2_1_2_8_2","volume-title":"Categories, allegories","author":"Freyd PJ","year":"1991"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","unstructured":"Gallego Arias E Lipton J (2012) Logic programming in tabular allegories. In: Dovier A Santos Costa (eds) Technical communications of the 28th international conference on logic programming (ICLP\u201912) Budapest. LIPIcs vol 17 pp 334\u2013347. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik","DOI":"10.1017\/S1471068412000300"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzq011"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"crossref","unstructured":"Gallego Arias E Lipton J Mari\u00f1o J (2015) Declarative compilation for constraint logic programming. In: Proietti M Seki H (eds) Logic-based program synthesis and transformation. Lecture notes in computer science vol 8981. Springer New York pp 299\u2013316","DOI":"10.1007\/978-3-319-17822-6_17"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"crossref","unstructured":"Hamfelt A Fischer Nilsson J (1998) Inductive synthesis of logic programs by composition of combinatory program schemes. In: Flener P (ed) 8th international workshop on logic-based program synthesis and transformation (LOPSTR\u201998). Lecture notes in computer science vol 1559. Springer New York pp 143\u2013158","DOI":"10.1007\/3-540-48958-4_8"},{"key":"e_1_2_1_2_13_2","unstructured":"Hamfelt A Nilsson JF Vitoria A (1998) A combinatory form of pure logic programs and its compositional semantics. Technical report"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"crossref","unstructured":"Jaffar J Maher MJ (1994) Constraint logic programming: a survey. J Log Program 19\/20:503\u2013581","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","unstructured":"Kinoshita Y John Power A (1996) A fibrational semantics for logic programs. In: Dyckhoff R Herre H Schroeder-Heister P (eds) ELP. Lecture notes in computer science vol 1050. Springer New York pp 177\u2013191","DOI":"10.1007\/3-540-60983-0_12"},{"key":"e_1_2_1_2_16_2","unstructured":"Komendantskaya E Power J (2011) Coalgebraic derivations in logic programming. In: Bezem M (ed) CSL. LIPIcs vol 12 pp 352\u2013366. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik"},{"key":"e_1_2_1_2_17_2","unstructured":"Lipton J Chapman E (1998) Some notes on logic programming with a relational machine. In: Jaoua A Kempf P Schmidt G (eds) Using relational methods in computer science. Technical report Nr. 1998-03 pp 1\u201334. Fakult\u00e4t f\u00e4r Informatik Universit\u00e4t der Bundeswehr M\u00e4nchen"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/2214"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"e_1_2_1_2_20_2","unstructured":"Nilsson JF (1990) Combinatory logic programming. In: Procs. of the 2nd workshop on meta-programming in logic. K.U. Leuven Belgium"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"crossref","unstructured":"Pfenning F Elliot C (1988) Higher-order abstract syntax. In: Proceedings of the ACM SIGPLAN 1988 conference on programming language design and implementation (PLDI\u201988). ACM New York pp 199\u2013208","DOI":"10.1145\/53990.54010"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","unstructured":"Rydeheard DE Burstall RM (1986) A categorical unification algorithm. In: Proceedings of a tutorial and workshop on category theory and computer programming. Springer New York pp 493\u2013505","DOI":"10.1007\/3-540-17162-2_139"},{"key":"e_1_2_1_2_23_2","doi-asserted-by":"crossref","unstructured":"Tarski A Givant S (1987) A formalization of set theory without variables. In: Colloquium publications vol 41. American Mathematical Society Providence","DOI":"10.1090\/coll\/041"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.06.016"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-016-0369-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-016-0369-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-016-0369-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-016-0369-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T16:03:51Z","timestamp":1641485031000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-016-0369-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1007\/s00165-016-0369-z"],"URL":"https:\/\/doi.org\/10.1007\/s00165-016-0369-z","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}