Default rules for Curry

In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is similar to logic languages and contrary to functional languages, e.g., Haskell enforces a strict sequential interpretation of rules. However, i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory and practice of logic programming Ročník 17; číslo 2; s. 121 - 147
Hlavní autoři: ANTOY, SERGIO, HANUS, MICHAEL
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge, UK Cambridge University Press 01.03.2017
Témata:
BASIC (programming language)
Completeness
Languages
Logic
Logic programming
Programming
Regular Papers
functional logic programming
program transformation
semantics
ISSN:1471-0684, 1475-3081
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is similar to logic languages and contrary to functional languages, e.g., Haskell enforces a strict sequential interpretation of rules. However, in some situations it is convenient to express alternatives by means of compact default rules. Although default rules are often used in functional programs, the non-deterministic nature of functional logic programs does not allow to directly transfer this concept from functional to functional logic languages in a meaningful way. In this paper, we propose a new concept of default rules for Curry that supports a programming style similar to functional programming while preserving the core properties of functional logic programming, i.e., completeness, non-determinism, and logic-oriented use of functions. We discuss the basic concept and propose an implementation which exploits advanced features of functional logic languages.
AbstractList In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is similar to logic languages and contrary to functional languages, e.g., Haskell enforces a strict sequential interpretation of rules. However, in some situations it is convenient to express alternatives by means of compact default rules. Although default rules are often used in functional programs, the non-deterministic nature of functional logic programs does not allow to directly transfer this concept from functional to functional logic languages in a meaningful way. In this paper, we propose a new concept of default rules for Curry that supports a programming style similar to functional programming while preserving the core properties of functional logic programming, i.e., completeness, non-determinism, and logic-oriented use of functions. We discuss the basic concept and propose an implementation which exploits advanced features of functional logic languages.
Author HANUS, MICHAEL
ANTOY, SERGIO
Author_xml – sequence: 1
  givenname: SERGIO
  surname: ANTOY
  fullname: ANTOY, SERGIO
  email: antoy@cs.pdx.edu
  organization: Computer Science Dept., Portland State University, Oregon, USA (e-mail: antoy@cs.pdx.edu)
– sequence: 2
  givenname: MICHAEL
  surname: HANUS
  fullname: HANUS, MICHAEL
  email: antoy@cs.pdx.edu
  organization: Computer Science Dept., Portland State University, Oregon, USA (e-mail: antoy@cs.pdx.edu)
BookMark eNp9kD1PAzEMQCNUJNrCjNgqsbAc2E0uSUdUPqVKDMB8yvkSdNX1UpK7of-elHZARTDZst-zbI_YoPWtZewC4RoB1c0rCoUgtUAJACj1ERumUp5x0Dj4zjHb9k_YKMblFuFTMWTnd9aZvukmoW9snDgfJvM-hM0pO3amifZsH8fs_eH-bf6ULV4en-e3i4x4Dl2mSHByBIQwLXHmQKKuptZZOyvJOON0hUSaSpnLXEupFSfJldCzSmnjBB-zq93cdfCfvY1dsaoj2aYxrfV9LFCnkwByLhN6eYAufR_atF2ipACRputEqR1FwccYrCuo7kxX-7YLpm4KhGL7sOLXw5KJB-Y61CsTNv86fO-YVRnq6sP-WOpP6wvEtHrh
CitedBy_id crossref_primary_10_1017_S1471068422000187
Cites_doi 10.1016/S0743-1066(98)10029-8
10.1007/3-540-08531-9
10.1145/1721654.1721675
10.1007/BFb0013825
10.1145/321850.321859
10.1016/0304-3975(96)00041-2
10.1051/ita/197610R100471
10.1017/S1471068403001728
10.1007/BFb0027000
10.1007/978-3-642-37651-1_6
10.1145/347476.347484
10.1007/978-3-642-61411-8
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2016
Copyright_xml – notice: Copyright © Cambridge University Press 2016
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/S1471068416000168
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
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
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
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
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 Science Database
Computer and Information Systems Abstracts
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
DocumentTitleAlternate Default rules for Curry
S. Antoy and M. Hanus
EISSN 1475-3081
EndPage 147
ExternalDocumentID 4311916871
10_1017_S1471068416000168
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
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
AEYYC
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
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
AAYXX
ABGDZ
ABXHF
AFFHD
AKMAY
CITATION
IPYYG
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
PUEGO
ID FETCH-LOGICAL-c350t-7c43cfc0c102b19f0618d2efee9bcafaf8d1cc8cb6565866873c637489d78af43
IEDL.DBID K7-
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000395794300001&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 Fri Sep 05 10:15:18 EDT 2025
Sun Jul 13 05:20:53 EDT 2025
Tue Nov 18 22:33:14 EST 2025
Sat Nov 29 04:58:35 EST 2025
Tue Jan 21 06:19:46 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords functional logic programming
program transformation
semantics
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-7c43cfc0c102b19f0618d2efee9bcafaf8d1cc8cb6565866873c637489d78af43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1864046878
PQPubID 43613
PageCount 27
ParticipantIDs proquest_miscellaneous_1884100536
proquest_journals_1864046878
crossref_citationtrail_10_1017_S1471068416000168
crossref_primary_10_1017_S1471068416000168
cambridge_journals_10_1017_S1471068416000168
PublicationCentury 2000
PublicationDate 20170300
2017-03-00
20170301
PublicationDateYYYYMMDD 2017-03-01
PublicationDate_xml – month: 03
  year: 2017
  text: 20170300
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 2017
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References Antoy (S1471068416000168_ref6) 2009
S1471068416000168_ref2
S1471068416000168_ref3
S1471068416000168_ref1
Sánchez-Hernández (S1471068416000168_ref25) 2006; 12
Antoy (S1471068416000168_ref4) 2005
S1471068416000168_ref8
S1471068416000168_ref9
Reddy (S1471068416000168_ref24) 1985
S1471068416000168_ref26
S1471068416000168_ref7
S1471068416000168_ref22
S1471068416000168_ref20
Moreno-Navarro (S1471068416000168_ref21) 1994
Brassel (S1471068416000168_ref11) 2004; 2004
Hanus (S1471068416000168_ref16) 2011
Antoy (S1471068416000168_ref5) 2006
S1471068416000168_ref19
S1471068416000168_ref18
S1471068416000168_ref17
S1471068416000168_ref15
S1471068416000168_ref14
Christiansen (S1471068416000168_ref13) 2013
S1471068416000168_ref10
Brassel (S1471068416000168_ref12) 2011
Peyton (S1471068416000168_ref23) 2003
References_xml – start-page: 87
  volume-title: Proc. of the 22nd International Conference on Logic Programming (ICLP 2006)
  year: 2006
  ident: S1471068416000168_ref5
– ident: S1471068416000168_ref15
  doi: 10.1016/S0743-1066(98)10029-8
– ident: S1471068416000168_ref8
– start-page: 49
  volume-title: Proc. of the 15th International Symposium on Principle and Practice of Declarative Programming (PPDP'13)
  year: 2013
  ident: S1471068416000168_ref13
– ident: S1471068416000168_ref22
  doi: 10.1007/3-540-08531-9
– start-page: 198
  volume-title: Technical Communications of the 27th International Conference on Logic Programming
  year: 2011
  ident: S1471068416000168_ref16
– ident: S1471068416000168_ref7
  doi: 10.1145/1721654.1721675
– start-page: 535
  volume-title: In Proc. 11th International Conference on Logic Programming
  year: 1994
  ident: S1471068416000168_ref21
– ident: S1471068416000168_ref1
  doi: 10.1007/BFb0013825
– ident: S1471068416000168_ref26
  doi: 10.1145/321850.321859
– ident: S1471068416000168_ref9
  doi: 10.1016/0304-3975(96)00041-2
– ident: S1471068416000168_ref10
  doi: 10.1051/ita/197610R100471
– start-page: 73
  volume-title: Proc. of the 11th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'09)
  year: 2009
  ident: S1471068416000168_ref6
– volume: 2004
  start-page: 6
  year: 2004
  ident: S1471068416000168_ref11
  article-title: Encapsulating non-determinism in functional logic computations
  publication-title: Journal of Functional and Logic Programming
– ident: S1471068416000168_ref20
  doi: 10.1017/S1471068403001728
– volume: 12
  start-page: 1574
  year: 2006
  ident: S1471068416000168_ref25
  article-title: Constructive failure in functional-logic programming: From theory to implementation
  publication-title: Journal of Universal Computer Science
– ident: S1471068416000168_ref2
  doi: 10.1007/BFb0027000
– ident: S1471068416000168_ref17
  doi: 10.1007/978-3-642-37651-1_6
– start-page: 6
  volume-title: Proceedings of the International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05)
  year: 2005
  ident: S1471068416000168_ref4
– ident: S1471068416000168_ref3
  doi: 10.1145/347476.347484
– volume-title: Haskell 98 Language and Libraries—The Revised Report
  year: 2003
  ident: S1471068416000168_ref23
– ident: S1471068416000168_ref18
– ident: S1471068416000168_ref14
  doi: 10.1007/978-3-642-61411-8
– ident: S1471068416000168_ref19
– start-page: 138
  volume-title: Proc. IEEE Internat. Symposium on Logic Programming
  year: 1985
  ident: S1471068416000168_ref24
– start-page: 1
  volume-title: Proc. of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011)
  year: 2011
  ident: S1471068416000168_ref12
SSID ssj0016324
Score 2.126112
Snippet In functional logic programs, rules are applicable independently of textual order, i.e., any rule can potentially be used to evaluate an expression. This is...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 121
SubjectTerms BASIC (programming language)
Completeness
Languages
Logic
Logic programming
Programming
Regular Papers
Title Default rules for Curry
URI https://www.cambridge.org/core/product/identifier/S1471068416000168/type/journal_article
https://www.proquest.com/docview/1864046878
https://www.proquest.com/docview/1884100536
Volume 17
WOSCitedRecordID wos000395794300001&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/eLvHCXMwpV3NS8MwFH_o5sGL89vpHBU8icWmX0lP4seGoIwhKsNLSV8TEEY39yH435vXtWUi7OKlhzQJIXl53_k9gHMROhgobswSyamEWeLYCZPMFomWwhgUrsz9kG9PvNcTg0HULxxu0yKtsuSJOaNOR0g-8ismQt_YcoKL6_GnTVWjKLpalNBYhzpzXUZ0_sjtKopAUOT56yJO2T3CL6OaBBlNjdTGwlztEcvYCr9l1G8WncudbuO_K96GrULjtG4WJLIDayrbhUZZzcEqLvceHN4rLefDmTWZD9XUMsqsReBN3_vw2u283D3YRdkEG73AmdkcfQ81Omh0h4RF2khskbpKKxUlKLXUImWIAhOjygUiNAv0MMxRaFIupPa9A6hlo0wdgaV54rqKi9RH5uvEmGcoIk6RQqPl8QibcFltWlwQ_zReJI7x-M8eN8Ep9zXGAoKcKmEMVw25qIaMF_gbqzq3ypNYWk11DE04q36bS0SREZmp0Zz6mEmIH4XHq6c4gU2X5HqehNaC2mwyV6ewgV-zj-mkDfXbTq__3M6p0Hz7wfsP1hPcVA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB58gV58P-ozgl7EYJKm2c1BRHxgaS09qIiXuJnsglBa7UPxT_kbnUmTUBF68-B1s7tZdmbnsTP7DcCBDBysaEFuiRJcwix27NhVri1joyQ5FJ5K7yEf6qLRkI-PYXMCvvK3MJxWmcvEVFAnHeQ78hNXBj75clLIs9c3m6tGcXQ1L6ExZIua_vwgl613Wr0k-h563vXV3cWNnVUVsLFccfq2QL-MBh0k1Rq7oSGFJhNPG63DGJVRRiYuosSYLJ2KDOiPZQxSkJZESGX8Ms07CdO-T84SnZ9m5amIWjD0efqaSXA2kfTzKCpDVHMjt7lBambJUSyHnzrxp0pI9dz1wn_boUWYzyxq63x4BJZgQreXYSGvVmFlwmsF1i-1UYNW3-oOWrpnkbFuMTjV5yrc_8ny1mCq3WnrDbCMiD1PC5n46PomJvcTZSg4EkpWrAixBMcFkaLscPeiYWKciH7RtAROTscIM4h1rvTRGjfkqBjyOsQXGdd5O6f8yGoKspdgv_hMQoIjP6qtOwPuQ5OwvA02x0-xB7M3d7f1qF5t1LZgzmMbJk2424apfnegd2AG3_svve5uyvkWPP81I30D69A4sA
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=Default+rules+for+Curry&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=ANTOY%2C+SERGIO&rft.au=HANUS%2C+MICHAEL&rft.date=2017-03-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=17&rft.issue=2&rft.spage=121&rft.epage=147&rft_id=info:doi/10.1017%2FS1471068416000168&rft.externalDocID=10_1017_S1471068416000168
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