{"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":1782422670961,"version":"3.54.5"},"reference-count":32,"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>Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable nondeterministic choices that would jeopardize the completeness of computations. In contrast to other approaches with this property, it does not require an upfront cloning of a possibly large portion of the choice's context. We formally define the pull-tab transformation, characterize the class of programs for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the correctness of the extended computations.<\/jats:p>","DOI":"10.1017\/s1471068411000263","type":"journal-article","created":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T09:15:37Z","timestamp":1309943737000},"page":"713-730","source":"Crossref","is-referenced-by-count":11,"title":["On the correctness of pull-tabbing"],"prefix":"10.1017","volume":"11","author":[{"given":"SERGIO","family":"ANTOY","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2011,7,6]]},"reference":[{"key":"S1471068411000263_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013825"},{"key":"S1471068411000263_ref19","first-page":"243","volume-title":"Handbook of Theoretical Computer Science B: Formal Methods and Semantics","author":"Dershowitz","year":"1990"},{"key":"S1471068411000263_ref32","first-page":"90","volume-title":"Proc. of 2004 International Conference on Functional Programming (ICFP)","author":"Tolmach","year":"2004"},{"key":"S1471068411000263_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45788-7_4"},{"key":"S1471068411000263_ref26","unstructured":"ISO. 1995. Information Technology - Programming Languages - Prolog - Part 1. General Core. ISO\/IEC 13211-1."},{"key":"S1471068411000263_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78969-7_12"},{"key":"S1471068411000263_ref18","unstructured":"Caballero R. and S\u00e1nchez J. , Eds. 2007. TOY: A Multiparadigm Declarative Language (version 2.3.1) [online]. URL: http:\/\/toy.sourceforge.net"},{"key":"S1471068411000263_ref31","first-page":"3","volume-title":"Handbook of Graph Grammars","author":"Plump","year":"1999"},{"key":"S1471068411000263_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76637-7_9"},{"key":"S1471068411000263_ref20","unstructured":"Echahed R. and Janodet J. C. 1997. On Constructor-Based Graph Rewriting Systems. Technical Report 985-I, IMAG. URL: ftp:\/\/ftp.imag.fr\/pub\/labo-LEIBNIZ\/OLD-archives\/PMP\/c-graph-rewriting.ps.gz"},{"key":"S1471068411000263_ref28","first-page":"197","volume-title":"Proc. of 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP '07)","author":"L\u00f3pez-Fraguas","year":"2007"},{"key":"S1471068411000263_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2004.12.007"},{"key":"S1471068411000263_ref16","doi-asserted-by":"crossref","unstructured":"Brassel B. 2011 Implementing Functional Logic Programs by Translation into Purely Functional Programs. PhD Thesis, Christian-Albrechts-Universit\u00e4t zu Kie (to appear).","DOI":"10.1007\/978-3-642-24452-0_2"},{"key":"S1471068411000263_ref15","volume-title":"Term Rewriting Systems","author":"Bezem","year":"2003"},{"key":"S1471068411000263_ref4","first-page":"199","volume-title":"Proc. of 3rd International Conference on Principles and Practice of Declarative Programming (PPDP '01)","author":"Antoy","year":"2001"},{"key":"S1471068411000263_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0027000"},{"key":"S1471068411000263_ref27","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"Klop","year":"1992"},{"key":"S1471068411000263_ref30","volume-title":"Equational Logic as a Programming Language","author":"O'Donnell","year":"1985"},{"key":"S1471068411000263_ref23","unstructured":"Hanus M. , Ed. 2008. PAKCS 1.9.1: The Portland Aachen Kiel Curry System. URL: http:\/\/www.informatik.uni-kiel.de\/~pakcs"},{"key":"S1471068411000263_ref10","first-page":"87","volume-title":"Proc. of 21nd International Conference on Logic Programming","author":"Antoy","year":"2006"},{"key":"S1471068411000263_ref1","first-page":"127","volume-title":"Proc. of 3rd International Workshop on Graph Computation Models","author":"Alqaddoumi","year":"2010"},{"key":"S1471068411000263_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90026-Y"},{"key":"S1471068411000263_ref21","first-page":"325","volume-title":"Proc. of Joint International Conference and Symposium on Logic Programming","author":"Echahed","year":"1998"},{"key":"S1471068411000263_ref7","first-page":"61","volume-title":"Proc. of 3rd International Workshop on Term Graph Rewriting (Termgraph '06)","author":"Antoy","year":"2006"},{"key":"S1471068411000263_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"S1471068411000263_ref24","volume-title":"Computational Logic: Essays in Honour of Alan Robinson","author":"Huet","year":"1991"},{"key":"S1471068411000263_ref9","first-page":"6","volume-title":"Proc. of 15th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '05)","author":"Antoy","year":"2005"},{"key":"S1471068411000263_ref11","first-page":"73","volume-title":"Proc. of 11th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP '09)","author":"Antoy","year":"2009"},{"key":"S1471068411000263_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11431664_7"},{"key":"S1471068411000263_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.01.006"},{"key":"S1471068411000263_ref22","unstructured":"Hanus M. , Ed. 2006. Curry: An integrated functional logic language (vers. 0.8.2) [online]. URL: http:\/\/www.informatik.uni-kiel.de\/~curry"},{"key":"S1471068411000263_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721675"}],"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\/S1471068411000263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:02:22Z","timestamp":1556352142000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068411000263\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":32,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S1471068411000263"],"URL":"https:\/\/doi.org\/10.1017\/s1471068411000263","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}