The maude system

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

Volumn 1631, Issue , 1999, Pages 240-243

  Clavel, M ^a   Duran F ^b   Eker, S ^b   Lincoln, P ^b   Marti Oliet N ^c   Meseguer, J ^b   Quesada, J F ^d  

^a UNIVERSITY OF NAVARRA   (Spain)

^b SRI INTERNATIONAL   (United States)

^c UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^d Centro Informatico Cientifico de Andalucia   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957700010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_18     Document Type: Conference Paper

References (9)

1. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. To appear in Theoretical Computer Science.
2. M. Clavel. Reflection in general logics and in rewriting logic, with applications to the Maude language. Ph.D. Thesis, University of Navarre, 1998.
3. M. Clavel, F. Durán, S. Eker, and J. Meseguer. Building equational logic tools by reflection in rewriting logic. In Proc. of the CafeOBJ Symposium '98, Numazu, Japan. CafeOBJ Project, April 1998.
4. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. Technical Report SRI-CSL-92-03, SRI International, Computer Science Laboratory, 1992. To appear in J.A. Goguen and G.R. Malcolm, editors, Applications of Algebraic Specification Using OBJ, Academic Press, 1998.
5. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996. http://www1.elsevier.nl/mcs/tcs/pc/volume4.htm.
6. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
7. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proc. CONCUR'96, Pisa, August 1996, pages 331-372. Springer LNCS 1119, 1996.
8. J. Meseguer. Membership algebra as a semantic framework for equational specification. In F. Parisi-Presicce, ed., Proc. WADT'97, 18-61, Springer LNCS 1376, 1998.
9. J. Quesada. The SCP parsing algorithm based on syntactic constraint propagation. Ph.D. thesis, University of Seville, 1997.