Comparing Meseguer’s rewriting logic with the logic CRWL. (English) Zbl 1268.68103
Hanus, Michael (ed.), WFLP 2001. Selected papers of the international workshop on functional and (constraint) logic programming, Kiel, Germany, September 13–15, 2001. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 64, 255-276 (2002).
Summary: Meseguer’s rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not possible to establish an entailment system map between them, but both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. We also use the syntactic results to prove reflective properties of CRWL and to extend those already known for Meseguer’s rewriting logic.
For the entire collection see [Zbl 1267.68023].
For the entire collection see [Zbl 1267.68023].
Software:
MaudeReferences:
| [1] | Arenas-Sánchez, P.; Rodríguez-Artalejo, M., A general framework for lazy functional logic programming with algebraic polymorphic types, Theory and Practice of Logic Programming, 1, 185-245 (2001) · Zbl 1066.68511 |
| [2] | Cengarle, M. V., The rewriting logic institution; Cengarle, M. V., The rewriting logic institution |
| [3] | Clavel M., “Reflection in General Logics and in Rewriting Logic, with Applications to the Maude Language,” Ph.D. thesis, Universidad de Navarra, Spain (1998).; Clavel M., “Reflection in General Logics and in Rewriting Logic, with Applications to the Maude Language,” Ph.D. thesis, Universidad de Navarra, Spain (1998). · Zbl 0917.68108 |
| [4] | Clavel, M., “Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications,”, CSLI Publications (2000) · Zbl 1003.03032 |
| [5] | Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martí-Oliet, N.; Meseguer, J.; Quesada, J. F., Maude: Specification and programming in rewriting logic, Theoretical Computer Science (2002), to appear · Zbl 1001.68059 |
| [6] | Clavel, M.; Meseguer, J., Reflection in conditional rewriting logic, Theoretical Computer Science (2002), to appear · Zbl 1001.68060 |
| [7] | Diaconescu, R.; Futatsugi, K., Logical foundations of CafeOBJ, Theoretical Computer Science (2002), to appear · Zbl 1001.68079 |
| [8] | Durán, F., “A Reflective Module Algebra with Applications to the Maude Language,” Ph.D. thesis, Universidad de Málaga, Spain (1999), http://maude.csl.sri.com.papers; Durán, F., “A Reflective Module Algebra with Applications to the Maude Language,” Ph.D. thesis, Universidad de Málaga, Spain (1999), http://maude.csl.sri.com.papers |
| [9] | Goguen, J.; Burstall, R., Institutions: Abstract model theory for specification and Programming, Journal of the Association for Computing Machinery, 39, 95-146 (1992) · Zbl 0799.68134 |
| [10] | González-Moreno, J. C.; Hortalá-González, M. T.; López-Fraguas, F. J.; Rodríguez-Artalejo, M., An approach to declarative programming based on a rewriting logic, Journal of Logic Programming, 40, 47-87 (1999) · Zbl 0942.68060 |
| [11] | Lambek, J., Subequalizers, Canadian Mathematical Bulletin, 13, 337-349 (1970) · Zbl 0201.02302 |
| [12] | Meseguer, J.; Ebbinghaus, H.-D.; Fernández-Prida, J.; Garrido, M.; Lascar, D.; Rodríguez-Artalejo, M., General logics, Logic Colloquium’87, 275-329 (1989) · Zbl 0691.03001 |
| [13] | Meseguer J., Rewriting as a unified model of concurrency; Meseguer J., Rewriting as a unified model of concurrency · Zbl 0758.68043 |
| [14] | Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, 96, 73-155 (1992) · Zbl 0758.68043 |
| [15] | Meseguer, J., Membership algebra as a logical framework for equational specification, (Parisi-Presicce, F., Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT’97, Tarquinia, Italy, June 3-7, 1997, Selected Papers, 1376 (1998)), 18-61 · Zbl 0903.08009 |
| [16] | Miyoshi H., Modelling Conditional Rewriting Logic in Structured CategoriesProceedings First International Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, California, September 3-6, 19964http://www.elsevier.nl/locate/entcs/volume4.html; Miyoshi H., Modelling Conditional Rewriting Logic in Structured CategoriesProceedings First International Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, California, September 3-6, 19964http://www.elsevier.nl/locate/entcs/volume4.html · Zbl 0912.68094 |
| [17] | Molina-Bravo, J. M., “Modularidad en Programació Lógico-Funcional de Primer Orden,” Ph.D. thesis, Universidad de Málaga, Spain (2000).; Molina-Bravo, J. M., “Modularidad en Programació Lógico-Funcional de Primer Orden,” Ph.D. thesis, Universidad de Málaga, Spain (2000). |
| [18] | Palomino Tarjuelo M., “Relating Meseguer”s rewriting logic with the constructor-based rewriting logic,“ Master”s thesis, Facultad de Matemáticas, Universidad Complutense de Madrid (2001), http://maude.csl.sri.com/papers; Palomino Tarjuelo M., “Relating Meseguer”s rewriting logic with the constructor-based rewriting logic,“ Master”s thesis, Facultad de Matemáticas, Universidad Complutense de Madrid (2001), http://maude.csl.sri.com/papers · Zbl 1268.68103 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
