{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T05:43:23Z","timestamp":1677908603130},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T00:00:00Z","timestamp":1309910400000},"content-version":"unspecified","delay-in-days":5,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2011,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Prolog's very useful expressive power is not captured by traditional logic programming semantics, due mainly to the cut and goal and clause order. Several alternative semantics have been put forward, exposing operational details of the computation state. We propose instead to redesign Prolog around structured alternatives to the cut and clauses, keeping the expressive power and computation model but with a compositional denotational semantics over much simpler states\u2014just variable bindings. This considerably eases reasoning about programs, by programmers and tools such as a partial evaluator, with safe unfolding of calls through predicate definitions. An<jats:monospace>if-then-else<\/jats:monospace>across clauses replaces most uses of the cut, but the cut's full power is achieved by an<jats:monospace>until<\/jats:monospace>construct. Disjunction, conjunction and<jats:monospace>until<\/jats:monospace>, along with unification, are the primitive goal types with a compositional semantics yielding sequences of variable-binding solutions. This extends to programs via the usual technique of a least fixpoint construction. A simple interpreter for Prolog in the alternative language, and a definition of<jats:monospace>until<\/jats:monospace>in Prolog, establish the identical expressive power of the two languages. Many useful control constructs are derivable from the primitives, and the semantic framework illuminates the discussion of alternative ones. The formalisation rests on a term language with variable abstraction as in the \u03bb-calculus. A clause is an abstraction on the call arguments, a continuation, and the local variables. It can be inclusive or exclusive, expressing a local case bound to a continuation by either a disjunction or an<jats:monospace>if-then-else<\/jats:monospace>. Clauses are open definitions, composed (and closed) with simple functional application \u03b2-reduction). This paves the way for a simple account of flexible module composition mechanisms.<jats:monospace>Cube<\/jats:monospace>, a concrete language with the exposed principles, has been implemented on top of a Prolog engine and successfully used to build large real-world applications.<\/jats:p>","DOI":"10.1017\/s1471068411000202","type":"journal-article","created":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T09:15:37Z","timestamp":1309943737000},"page":"611-627","source":"Crossref","is-referenced-by-count":1,"title":["A structured alternative to Prolog with simple compositional semantics"],"prefix":"10.1017","volume":"11","author":[{"given":"ANT\u00d3NIO","family":"PORTO","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,7,6]]},"reference":[{"key":"S1471068411000202_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16492-8_111"},{"key":"S1471068411000202_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90026-4"},{"key":"S1471068411000202_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00012-6"},{"key":"S1471068411000202_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36388-2_8"},{"key":"S1471068411000202_ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"A\u00eft-Kaci","year":"1991"},{"key":"S1471068411000202_ref4","first-page":"293","volume-title":"Logic and Databases","author":"Clark","year":"1978"},{"key":"S1471068411000202_ref10","first-page":"379","volume-title":"ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems.","author":"Li","year":"1994"},{"key":"S1471068411000202_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"S1471068411000202_ref16","first-page":"184","volume-title":"Proceedings of the 1999 international conference on Logic programming","author":"Seres","year":"1999"},{"key":"S1471068411000202_ref5","first-page":"231","volume-title":"Logic Programming","author":"Colmerauer","year":"1993"},{"key":"S1471068411000202_ref9","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.6.719"},{"key":"S1471068411000202_ref14","first-page":"275","volume-title":"Functional and Logic Programming, 6th International Symposium, FLOPS 2002, Proceedings","author":"Porto","year":"2002"},{"key":"S1471068411000202_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(88)90007-6"},{"key":"S1471068411000202_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00152-7"},{"key":"S1471068411000202_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001540"},{"key":"S1471068411000202_ref6","first-page":"178","volume-title":"TAPSOFT '89; Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"de Bruin","year":"1989"},{"key":"S1471068411000202_ref11","first-page":"284","volume-title":"Logic Programming, Proceedings of the Sixth International Conference","author":"Monteiro","year":"1989"},{"key":"S1471068411000202_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068411000202_ref8","volume-title":"Prolog: The Standard; reference manual","author":"Deransart","year":"1991"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068411000202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T05:01:24Z","timestamp":1592715684000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068411000202\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S1471068411000202"],"URL":"https:\/\/doi.org\/10.1017\/s1471068411000202","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}