Generalized rewrite theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 252-266

  Bruni, Roberto ^a,b   Meseguer, José ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; RECONFIGURABLE HARDWARE; SEMANTICS;

EQUATIONAL LOGIC; INFERENCE RULES; LOGICAL FRAMEWORKS; MAUDE SYSTEM; MODEL THEORY; PROGRAMMING PARADIGMS; REWRITE THEORY; REWRITING LOGIC;

COMPUTER CIRCUITS;

EID: 35248887958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_22     Document Type: Article

References (14)

1. H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. Proc. FoSSaCS'01, LNCS 2030, pp. 168-183. Springer, 2001.
2. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: Specification and programming in rewriting logic. TCS 285:187-243, 2002.
3. R. Diaconescu and K. Futatsugi. CafeOBJ Report: The language, proof techniques, and methodologies for object-oriented algebraic specification, AMAST Series in Computing volume 6. World Scientific, 1998.
4. S. Lucas. Termination of rewriting with strategy annotations. Proc. LPAR'01, Lect. Notes in Artificial Intelligence 2250, pp. 669-684. Springer, 2001.
5. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Handbook of Philosophical Logic volume 9, pp. 1-87. Kluwer, second edition, 2002.
6. N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoret. Comput. Sci. 285(2):121-154, 2002.
7. N. Martí-Oliet, K. Sen, and P. Thati. An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. Proc. WRLA'02, ENTCS 71. Elsevier, 2002.
8. N. Martí-Oliet and A. Verdejo. Implementing CCS in Maude 2. Proc. WRLA'02, ENTCS 71. Elsevier, 2002.
9. J. Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02R, SRI International, Computer Science Laboratory, 1990.
10. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73-155, 1992.
11. J. Meseguer. Membership algebra as a logical framework for equational specification. Proc. WADT'97, LNCS 1376, pp. 18-61. Springer, 1998.
12. Protheo Team. The ELAN home page, 2001. www page http://elan.loria.fr.
13. M.-O. Stehr, J. Meseguer, and P. Ölveczky. Rewriting logic as a unifying framework for Petri nets. Unifying Petri Nets, LNCS 2128, pp. 250-303. Springer, 2001.
14. M.-O. Stehr and J. Meseguer. Pure Type Systems in Rewriting Logic. Proc. LFM'99. 1999.