English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160143
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Bi-rewriting Rewriting Logic

AuthorsSchorlemmer, Marco
KeywordsEquational logic
Operational semantics
Rewriting logic
Bi-writing techniques
Issue Date1996
CitationElectronic Notes in Theoretical Computer Science 4: 266- 283 (1996)
AbstractRewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to first-order theories with arbitrary possibly non-symmetric transitive relations, because this was an important breakthrough for the automation of deduction in these kind of theories. I show that a proof calculus based on the bi-rewriting technique may serve as framework of different proof calculi, by analizing those of equational logic and Horn logic, and presenting them as specific cases of bi-rewrite systems. Deduction is then essentially bi-rewriting a theory of rewriting logic. Since recently the interest in specifications based on theories with transitive relations has arisen, the result of this research towards a general framework for bi-rewriting based operational semantics of several programming paradigms will also be very useful for the development of rapid prototyping tools for these kind of specifications. © 2000.
Identifiersdoi: 10.1016/S1571-0661(04)00043-X
issn: 1571-0661
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
ENTCS4(1996)_266-83.pdf276,98 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.