On the correctness of pull-tabbing

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 no...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 11; no. 4-5; pp. 713 - 730
Main Author: ANTOY, SERGIO
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2011
Subjects:
Cloning
Completeness
Computation
Graphs
Logic
Logic programming
Regular Papers
Transformations
graph rewriting
pull-tabbing
functional logic programming
nondeterminism
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
Abstract 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. [PUBLICATION ABSTRACT]
Author ANTOY, SERGIO
Author_xml – sequence: 1
  givenname: SERGIO
  surname: ANTOY
  fullname: ANTOY, SERGIO
  email: antoy@cs.pdx.edu
  organization: Computer Science Department, Portland State University, Portland, OR 97207, USA (e-mail: antoy@cs.pdx.edu)
BookMark eNp9kE9LAzEQxYNUsK1-AG9LT15WM0k22Ryl-A8KPajnJUmTumWb1CR78Nu7tQVB0dMMM-8383gTNPLBW4QuAV8DBnHzDEwA5jUDwBgTTk_QeBhVJcU1jL56KPf7MzRJaYMxcErYGM2WvshvtjAhRmuytykVwRW7vuvKrLRu_focnTrVJXtxrFP0en_3Mn8sF8uHp_ntojSUyVxCtTLGKCyNkMJZi52uDCNKKmO001xUjnMlmeJEVCtJNGWVZVpjy7nVjtApujrc3cXw3tuUm22bjO065W3oUwPDG0aA1mKQzn5IN6GPfnDX1FJSTAjfi8RBZGJIKVrXmDar3Aafo2q7BnCzj675Fd1Awg9yF9utih__MvTIqK2O7Wptvz39TX0Cqd1_Xg
CitedBy_id crossref_primary_10_1145_3607845
Cites_doi 10.1007/978-3-540-78969-7_12
10.1016/0743-1066(92)90026-Y
10.1016/j.jsc.2004.12.007
10.1145/1721654.1721675
10.1007/978-3-540-76637-7_9
10.1007/3-540-45788-7_4
10.1007/BFb0013825
10.1007/978-3-642-24452-0_2
10.1016/j.jsc.2010.01.006
10.1007/BFb0027000
10.1007/11431664_7
10.1017/CBO9781139172752
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2011
Copyright_xml – notice: Copyright © Cambridge University Press 2011
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068411000263
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
ProQuest Advanced Technologies & Aerospace Database (NC LIVE)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList Computer and Information Systems Abstracts
Computer Science Database

CrossRef
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 730
ExternalDocumentID 2490686541
10_1017_S1471068411000263
Genre Feature
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
NIKVX
O9-
OYBOY
P2P
P62
PHGZT
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
PHGZM
PQGLB
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
PRINS
Q9U
PUEGO
ID FETCH-LOGICAL-c349t-15dccca09c797fee0fb5c42a9accbfb675f66a94a6275d92b345e4bb0e66ebf23
IEDL.DBID K7-
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000292701100018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Thu Sep 04 17:36:14 EDT 2025
Fri Jul 25 22:50:13 EDT 2025
Tue Nov 18 21:04:19 EST 2025
Sat Nov 29 04:58:34 EST 2025
Wed Mar 05 09:16:29 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4-5
Keywords graph rewriting
pull-tabbing
functional logic programming
nondeterminism
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-15dccca09c797fee0fb5c42a9accbfb675f66a94a6275d92b345e4bb0e66ebf23
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 899302267
PQPubID 43613
PageCount 18
ParticipantIDs proquest_miscellaneous_1349421387
proquest_journals_899302267
crossref_citationtrail_10_1017_S1471068411000263
crossref_primary_10_1017_S1471068411000263
cambridge_journals_10_1017_S1471068411000263
PublicationCentury 2000
PublicationDate 20110700
2011-07-00
20110701
PublicationDateYYYYMMDD 2011-07-01
PublicationDate_xml – month: 07
  year: 2011
  text: 20110700
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2011
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068411000263_ref3
S1471068411000263_ref2
S1471068411000263_ref22
Klop (S1471068411000263_ref27) 1992
S1471068411000263_ref23
Dershowitz (S1471068411000263_ref19) 1990
S1471068411000263_ref8
S1471068411000263_ref20
S1471068411000263_ref5
Antoy (S1471068411000263_ref7) 2006
S1471068411000263_ref6
S1471068411000263_ref29
Huet (S1471068411000263_ref24) 1991
Antoy (S1471068411000263_ref9) 2005
S1471068411000263_ref26
López-Fraguas (S1471068411000263_ref28) 2007
S1471068411000263_ref25
Alqaddoumi (S1471068411000263_ref1) 2010
Antoy (S1471068411000263_ref4) 2001
Tolmach (S1471068411000263_ref32) 2004
Antoy (S1471068411000263_ref11) 2009
S1471068411000263_ref13
S1471068411000263_ref12
O'Donnell (S1471068411000263_ref30) 1985
Plump (S1471068411000263_ref31) 1999
Bezem (S1471068411000263_ref15) 2003
Antoy (S1471068411000263_ref10) 2006
S1471068411000263_ref18
Echahed (S1471068411000263_ref21) 1998
S1471068411000263_ref14
S1471068411000263_ref17
S1471068411000263_ref16
References_xml – ident: S1471068411000263_ref29
  doi: 10.1007/978-3-540-78969-7_12
– start-page: 199
  volume-title: Proc. of 3rd International Conference on Principles and Practice of Declarative Programming (PPDP '01)
  year: 2001
  ident: S1471068411000263_ref4
– ident: S1471068411000263_ref25
  doi: 10.1016/0743-1066(92)90026-Y
– ident: S1471068411000263_ref26
– start-page: 1
  volume-title: Handbook of Logic in Computer Science
  year: 1992
  ident: S1471068411000263_ref27
– start-page: 6
  volume-title: Proc. of 15th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '05)
  year: 2005
  ident: S1471068411000263_ref9
– volume-title: Term Rewriting Systems
  year: 2003
  ident: S1471068411000263_ref15
– start-page: 61
  volume-title: Proc. of 3rd International Workshop on Term Graph Rewriting (Termgraph '06)
  year: 2006
  ident: S1471068411000263_ref7
– start-page: 243
  volume-title: Handbook of Theoretical Computer Science B: Formal Methods and Semantics
  year: 1990
  ident: S1471068411000263_ref19
– volume-title: Equational Logic as a Programming Language
  year: 1985
  ident: S1471068411000263_ref30
– start-page: 90
  volume-title: Proc. of 2004 International Conference on Functional Programming (ICFP)
  year: 2004
  ident: S1471068411000263_ref32
– start-page: 197
  volume-title: Proc. of 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP '07)
  year: 2007
  ident: S1471068411000263_ref28
– start-page: 87
  volume-title: Proc. of 21nd International Conference on Logic Programming
  year: 2006
  ident: S1471068411000263_ref10
– ident: S1471068411000263_ref22
– ident: S1471068411000263_ref20
– start-page: 73
  volume-title: Proc. of 11th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP '09)
  year: 2009
  ident: S1471068411000263_ref11
– start-page: 325
  volume-title: Proc. of Joint International Conference and Symposium on Logic Programming
  year: 1998
  ident: S1471068411000263_ref21
– ident: S1471068411000263_ref5
  doi: 10.1016/j.jsc.2004.12.007
– ident: S1471068411000263_ref12
  doi: 10.1145/1721654.1721675
– ident: S1471068411000263_ref17
  doi: 10.1007/978-3-540-76637-7_9
– start-page: 127
  volume-title: Proc. of 3rd International Workshop on Graph Computation Models
  year: 2010
  ident: S1471068411000263_ref1
– ident: S1471068411000263_ref8
  doi: 10.1007/3-540-45788-7_4
– ident: S1471068411000263_ref2
  doi: 10.1007/BFb0013825
– start-page: 3
  volume-title: Handbook of Graph Grammars
  year: 1999
  ident: S1471068411000263_ref31
– ident: S1471068411000263_ref16
  doi: 10.1007/978-3-642-24452-0_2
– ident: S1471068411000263_ref23
– ident: S1471068411000263_ref6
  doi: 10.1016/j.jsc.2010.01.006
– volume-title: Computational Logic: Essays in Honour of Alan Robinson
  year: 1991
  ident: S1471068411000263_ref24
– ident: S1471068411000263_ref3
  doi: 10.1007/BFb0027000
– ident: S1471068411000263_ref13
  doi: 10.1007/11431664_7
– ident: S1471068411000263_ref18
– ident: S1471068411000263_ref14
  doi: 10.1017/CBO9781139172752
SSID ssj0016324
Score 1.9557688
Snippet Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable...
Abstract Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 713
SubjectTerms Cloning
Completeness
Computation
Graphs
Logic
Logic programming
Regular Papers
Transformations
Title On the correctness of pull-tabbing
URI https://www.cambridge.org/core/product/identifier/S1471068411000263/type/journal_article
https://www.proquest.com/docview/899302267
https://www.proquest.com/docview/1349421387
Volume 11
WOSCitedRecordID wos000292701100018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58Hbz4FtcXVTyJwW6TNu1JVBRBWBdREC9LMpuIIN11t_r7nem2VRH24qWHNClhZjKPzPQbgCMXehVKo4SNjREKlRIp-eECMyM9GXzEBMtmE7rTSZ-esm5VmzOuyiprnVgq6v4A-Y78lOICSfYm0WfDd8FNozi5WnXQmIX5dhS1WcxvtWiSCIxEXv5cpLm4J1V1UpMRo3mQxxgxjcIQ-RNa4beJ-q2hS7NzvfzPDa_AUuVvBucTAVmFGZevwXLdyyGojvY6HN7lAfmCAXK3DixYAQYDHwwpQhWFsRQ_v2zA4_XVw-WNqPonCJQqK0Q77iMxKMxQZ9o7YouNUUUmM4jWWwoVfJKYTBlGKu5nkZUqdsra0CWJsz6SmzCXD3K3BYFXUmJi25ImKu-TlNwO5zwFT15rYmkLThry9apTMO5NKsh07w-1WxDWFO5hhUXOLTHepi05bpYMJ0Ac0ybv1Dz53k3DkBYcNG_pMHGGxORu8EEbZrAeEqRUb0_9wg4sTu6WuWx3F-aK0YfbgwX8LF7Ho32Yv7jqdO_3S2mkZzd-_gKVNODY
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hikQvvNqqW14popeqFtnYiZNDhRAPgYAtByqhXlJ71pYqoeyWDUX8KP5jZ_IqCGlvHHpN7GiUeXvG3wBsu9CrUBolbGyMUKiUSCkOF5gZ6cnhIyZYDZvQg0F6dZVdzMBDexeG2ypbm1gZ6uEI-Yx8h_ICSf4m0bvj34KHRnFxtZ2gUUvFqbu_o4xt8vXkgNj7KYqODi_3j0UzVECgVFkp-vEQieowQ51p74hWG6OKTGYQrbcUP_skMZkyDN87zCIrVeyUtaFLEmc94xyQxX-lFOVKpD4X8Y-uaMHI59VlJs3NRKlqi6iMUM0P-RkjtFHaIx9DOTx1iU89QuXmjhb_sx-0BAtNPB3s1QqwDDOuWIHFdlZF0JiuN7D1rQgo1g2Qp5FgyQY-GPlgTBm4KI215MHfwvcXofQdzBajwr2HwCspMbF9SQuV90lKYZVznpJDrzWJbA--dOzKGy2f5HWHnM6fcbcHYcvRHBusdR75cT1ty-duy7gGGpm2eLWVgX_UdALQg4_dWzIWXAEyhRvdEsEMRhT1Zao_TP3CJswfX56f5Wcng9NVeF2fo3OL8hrMlje3bh3m8E_5a3KzUWlAAD9fWqL-AhRfP1A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+correctness+of+pull-tabbing&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=ANTOY%2C+SERGIO&rft.date=2011-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=11&rft.issue=4-5&rft.spage=713&rft_id=info:doi/10.1017%2FS1471068411000263&rft.externalDocID=2490686541
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon