Building Equational Proving Tools by Reflection in Rewriting Logic

[1]  Jan A. Bergstra,et al.  A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method , 1980, ICALP.

[2]  J. V. Tucker,et al.  A characterization of computable data types by means of a finite, equational specification mehod , 1980 .

[3]  Claude Kirchner,et al.  Order-sorted equational unification , 1988 .

[4]  Joseph A. Goguen,et al.  OBJ as a Theorem Prover with Applications to Hardware Verification , 1989 .

[5]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Claude Kirchner,et al.  Equational Completion in Order-Sorted Algebras , 1990, Theor. Comput. Sci..

[7]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[8]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[9]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[10]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[11]  Patrick Viry.  Rewriting: An Effective Model of Concurrency , 1994, PARLE.

[12]  José Meseguer,et al.  Reflection and strategies in rewriting logic , 1996, WRLA.

[13]  José Meseguer,et al.  Axiomatizing Reflective Logics and Languages , 1996 .

[14]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[15]  M. Clavel,et al.  Principles of Maude , 1996, WRLA.

[16]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[17]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[18]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[19]  Roberto Bruni,et al.  Internal strategies in a rewriting implementation of tile systems , 1998, WRLA.

[20]  LaboratorySRI InternationalMenlo Park.  Formal Interoperability , 1998 .

[21]  J. Meseguer,et al.  Process and Term Tile Logic , 1998 .

[22]  S. Eker,et al.  Metalevel computation in Maude , 1998, WRLA.

[23]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[24]  M. Clavel.  Reflection in general logics and in rewriting logic with applications to the maude languaje , 1998 .

[25]  Francisco Durán,et al.  An extensible module algebra for Maude , 1998, WRLA.

[26]  Francisco Durán,et al.  Maude as a Formal Meta-tool , 1999, World Congress on Formal Methods.

[27]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..