Rewriting and narrowing for constructor systems with call-time choice semantics

dc.contributor.authorLópez Fraguas, Francisco Javier
dc.contributor.authorMartín Martín, Enrique
dc.contributor.authorRodríguez Hortalá, Juan
dc.contributor.authorSánchez Hernández, Jaime
dc.date.accessioned2023-06-19T14:59:58Z
dc.date.available2023-06-19T14:59:58Z
dc.date.issued2014-03
dc.description.abstractNon-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is a non trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper we develop thoroughly the theory for the first order version of letrewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to letre writing. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing, providing in particular soundness and completeness of let-rewriting with respect to term rewriting for a class of programs which are deterministic in a semantic sense.
dc.description.departmentDepto. de Sistemas Informáticos y Computación
dc.description.facultyFac. de Informática
dc.description.refereedTRUE
dc.description.sponsorshipComunidad de Madrid
dc.description.sponsorshipMinisterio de Economía y Competitividad (MINECO)
dc.description.sponsorshipUniversidad Complutense de Madrid
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/36061
dc.identifier.doi10.1017/S1471068412000373
dc.identifier.issn1471-0684
dc.identifier.officialurlhttp://journals.cambridge.org/action/displayFulltext?type=1&fid=9188677&jid=TLP&volumeId=14&issueId=02&aid=9188675&bodyId=&membershipNumber=&societyETOCSession=
dc.identifier.urihttps://hdl.handle.net/20.500.14352/35084
dc.issue.number14.2
dc.journal.titleTheory and Practice of Logic Programming
dc.language.isoeng
dc.page.final213
dc.page.initial165
dc.publisherCambridge University Press
dc.relation.projectIDPROMETIDOS-CM (S2009TIC-1465)
dc.relation.projectIDFAST-STAMP (TIN2008-06622-C03- 01/TIN)
dc.relation.projectIDGPD-UCM (UCM-BSCH-GR58/08-910502)
dc.rights.accessRightsopen access
dc.subject.cdu004.415.2
dc.subject.cdu519.768
dc.subject.cdu004.432.4
dc.subject.keywordTerm rewriting systems
dc.subject.keywordconstructor-based rewriting logic
dc.subject.keywordnarrowing
dc.subject.keywordnondeterminism
dc.subject.keywordcall-time choice semantics
dc.subject.keywordsharing
dc.subject.keywordlocal bindings
dc.subject.ucmLenguajes de programación
dc.subject.ucmSistemas expertos
dc.subject.unesco1203.23 Lenguajes de Programación
dc.titleRewriting and narrowing for constructor systems with call-time choice semantics
dc.typejournal article
dc.volume.numberMarch
dspace.entity.typePublication
relation.isAuthorOfPublication9f1acb56-806e-4ab4-b939-8b692d5629bd
relation.isAuthorOfPublication8c7dbac8-1093-454e-a0cf-e7b2f316cf09
relation.isAuthorOfPublication19b4fb29-4f3e-4062-a5bd-59e19e25c448
relation.isAuthorOfPublicationf0eee9a9-5f99-4e32-8f7e-db6418a011bc
relation.isAuthorOfPublication.latestForDiscovery8c7dbac8-1093-454e-a0cf-e7b2f316cf09

Download

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TPLP-final version rewr.pdf
Size:
734.63 KB
Format:
Adobe Portable Document Format

Collections