Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Theoretical Computer Science

Volumn 373, Issue 1-2, 2007, Pages 70-91

  Clavel, Manuel ^a   Meseguer, José ^b   Palomino, Miguel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Maude; Membership equational logic; Reflection; Reflective logics; Reflective programming languages; Rewriting logic; Universal theories

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MEMBERSHIP FUNCTIONS; REFLECTION;

MAUDE; MEMBERSHIP EQUATIONAL LOGIC; REFLECTIVE LOGICS; REFLECTIVE PROGRAMMING LANGUAGES; REWRITING LOGIC; UNIVERSAL THEORIES;

FORMAL LOGIC;

EID: 33847315579     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.009     Document Type: Article

References (54)

1. K. Asai, Reflecting on the metalevel interpreter written in direct style, in: International Lisp Conference 2003, ILC 2003, http://pllab.is.ocha.ac.jp/~asai/papers/papers.html
2. Baalen J.V., Caldwell J.L., and Mishra S. Specifying and checking fault-tolerant agent-based protocols using Maude. First Goddard Workshop on Formal Approaches to Agent-Based Systems. 5-7 April 2000, Greenbelt, MD, USA, Proceedings. Lecture Notes in Computer Science vol. 1871 (2000), Springer-Verlag 180-193
3. Basin D., Clavel M., and Meseguer J. Reflective metalogical frameworks. ACM Transactions on Computational Logic 5 3 (2004) 528-576
4. Borovanský P., Kirchner C., Kirchner H., and Moreau P.-E. ELAN from a rewriting logic point of view. Theoretical Computer Science 285 2 (2002) 155-185
5. Bouhoula A., Jouannaud J.-P., and Meseguer J. Specification and proof in membership equational logic. Theoretical Computer Science 236 (2000) 35-132
6. Boyer R.S., and Moore J.S. Metafunctions: Proving them correct and using them efficiently as new proof procedures. In: Boyer R., and Moore J. (Eds). The Correctness Problem in Computer Science (1981), Academic Press 103-185
7. Bruni R., and Meseguer J. Generalized rewrite theories. In: Baeten J.C.M., Lenstra J.K., Parrow J., and Woeginger G.J. (Eds). Automata, Languages and Programming. 30th International Colloquium. ICALP 2003, June 30-July 4 2003, Eindhoven, The Netherlands, Proceedings. Lecture Notes in Computer Science vol. 2719 (2003), Springer-Verlag 252-266
8. W. Cazzola, S. Chiba, G. Saake, RAM-SE'04. ECOOP'2004 Workshop on Reflection, AOP and Meta-Data for Software Evolution, http://www.disi.unige.it/person/CazzolaW/RAM-SE04.html
9. Ciobanu G., and Lucanu D. Communicating concurrent objects in hidden CCS. In: Martí-Oliet N. (Ed). Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA'04, 27-28 March 2004, Barcelona, Spain. Electronic Notes in Theoretical Computer Science (2004), Elsevier 329-347
10. Clavel M. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications (2000), CSLI Publications
11. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J.F. Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285 2 (2002) 187-243
12. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Talcott C. Maude manual (version 2.2) (2005). http://maude.cs.uiuc.edu/manual/
13. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Talcott C.L. All About Maude, A High-Performance Logical Framework. Lecture Notes in Computer Science vol. 4350 (2007), Springer-Verlag
14. Clavel M., Durán F., Eker S., Meseguer J., and Stehr M.-O. Maude as a formal meta-tool. In: Wing J.M., Woodcock J., and Davies J. (Eds). FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems. 20-24 September 1999, Toulouse, France, Proceedings, Volume II. Lecture Notes in Computer Science vol. 1709 (1999), Springer-Verlag 1684-1703
15. Clavel M., Martí-Oliet N., and Palomino M. Formalizing and proving semantic relations between specifications by reflection. In: Rattray C., Maharaj S., and Shankland C. (Eds). Algebraic Methodology and Software Technology. 10th International Conference. AMAST 2004, 12-16 July 2004, Stirling, Scotland, UK, Proceedings. Lecture Notes in Computer Science vol. 3116 (2004), Springer-Verlag 72-86
16. M. Clavel, J. Meseguer, Axiomatizing reflective logics and languages, in: G. Kiczales (Ed.), Proceedings of Reflection'96, April 1996, San Francisco, CA, 1996, pp. 263-288
17. Clavel M., and Meseguer J. Reflection in conditional rewriting logic. Theoretical Computer Science 285 2 (2002) 245-288
18. Clavel M., Palomino M., and Riesco A. Introducing the ITP tool: A tutorial. In: López-Fraguas F. (Ed). PROLE'05. Selected papers. Journal of Universal Computer Science 12 11 (2006) 1618-1650
19. In: Cointe P. (Ed). Meta-Level Architectures and Reflection, Second International Conference. Reflection'99 Saint-Malo, 19-21 July 1999, France, Proceedings. Lecture Notes in Computer Science vol. 1616 (1999), Springer-Verlag
20. In: Denker G., and Talcott C. (Eds). Proceedings Sixth International Workshop on Rewriting Logic and its Applications. WRLA'06, 1-2 April 2006, Vienna, Austria. Electronic Notes in Theoretical Computer Science (2006), Elsevier
21. Douence R., and Südholt M. A generic reification technique for object-oriented reflective languages. Higher-Order and Symbolic Computation 14 1 (2001) 7-34
22. F. Durán, A Reflective Module Algebra with Applications to the Maude Language, Ph.D. Thesis, Universidad de Málaga, Spain, June 1999, http://maude.cs.uiuc.edu/papers
23. Durán F. The extensibility of Maude's module algebra. In: Rus T. (Ed). Algebraic Methodology and Software Technology, 8th International Conference. AMAST 2000, 20-27 May 2000, IA City, Iowa, USA, Proceedings. Lecture Notes in Computer Science vol. 1816 (2000), Springer-Verlag 422-437
24. Durán F., Escobar S., and Lucas S. New evaluation commands for Maude within Full Maude. In: Martí-Oliet N. (Ed). Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA'04, 27-28 March 2004, Barcelona, Spain. Electronic Notes in Theoretical Computer Science (2004), Elsevier 245-266
25. Durán F., and Meseguer J. A Church-Rosser checker tool for Maude equational specifications (2000). http://maude.cs.uiuc.edu/tools
26. Fischer B., and Roşu G. Interpreting abstract interpretations in membership equational logic. In: van den Brand M., and Verma R. (Eds). Proceedings of the International Workshop on Rule-Based Programming. RULE'01. Electronic Notes in Theoretical Computer Science vol. 59 (2001), Elsevier
27. In: Futatsugi K. (Ed). Proceedings Third International Workshop on Rewriting Logic and its Applications. WRLA'00, 10-20 September 2000, Kanazawa, Japan. Electronic Notes in Theoretical Computer Science vol. 36 (2000), Elsevier. http://www.elsevier.com/locate/entcs/volume36.html
28. Futatsugi K., and Diaconescu R. CafeOBJ Report. AMAST Series (1998), World Scientific
29. In: Gadducci F., and Montanari U. (Eds). Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA'02, 19-21 September 2002, Pisa, Italy. Electronic Notes in Theoretical Computer Science vol. 71 (2002), Elsevier. http://www.elsevier.com/locate/entcs/volume71.html
30. F. Giunchiglia, P. Traverso, A. Cimatti, P. Pecchiari, A system for multi-level reasoning, in: Proceedings IMSA'92 - International Workshop on Reflection and Meta-Level Architecture, Information-Technology Promotion Agency, Japan, 1992, pp. 190-195
31. Goguen J., and Meseguer J. Completeness of many-sorted equational logic. Houston Journal of Mathematics 11 3 (1985) 307-334
32. Hill P.M., and Lloyd J.W. The Gödel Programming Language (1994), MIT Press
33. Kiczales G., des Rivieres J., and Bobrow D.G. The Art of the Metaobject Protocol (1991), MIT Press
34. In: Kirchner C., and Kirchner H. (Eds). Proceedings Second International Workshop on Rewriting Logic and its Applications. WRLA'98, 1-4 September 1998, Pont-à-Mousson, France. Electronic Notes in Theoretical Computer Science vol. 15 (1998), Elsevier. http://www.elsevier.com/locate/entcs/volume15.html
35. In: Martí-Oliet N. (Ed). Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA'04, 27-28 March 2004, Barcelona, Spain. Electronic Notes in Theoretical Computer Science (2004), Elsevier
36. Martí-Oliet N., and Meseguer J. Rewriting logic as a logical and semantic framework. In: Gabbay D. (Ed). Handbook of Philosophical Logic, vol. 9. second edn (2002), Kluwer 1-81
37. Martí-Oliet N., and Meseguer J. Rewriting logic: Roadmap and bibliography. Theoretical Computer Science 285 2 (2002) 121-154
38. Martí-Oliet N., Meseguer J., and Verdejo A. Towards a strategy language for Maude. In: Martí-Oliet N. (Ed). Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA'04, 27-28 March 2004, Barcelona, Spain. Electronic Notes in Theoretical Computer Science (2004), Elsevier 391-414
39. Matsuoka S., Watanabe T., Ichisugi Y., and Yonezawa A. Object-oriented concurrent reflective architectures. In: Tokoro M., Nierstrasz O., and Wegner P. (Eds). Object-Based Concurrent Computing. Lecture Notes in Computer Science vol. 612 (1992), Springer-Verlag 211-226
40. Meseguer J. General logics. In: Ebbinghaus H.-D., Fernández-Prida J., Garrido M., Lascar D., and Rodríguez-Artalejo M. (Eds). Logic Colloquium'87 (1989), North-Holland 275-329
41. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 1 (1992) 73-155
42. In: Meseguer J. (Ed). Proceedings First International Workshop on Rewriting Logic and its Applications. WRLA'96, 3-6 September 1996, Asilomar, CA. Electronic Notes in Theoretical Computer Science vol. 4 (1996), Elsevier. http://www.elsevier.com/locate/entcs/volume4.html
43. Meseguer J. Membership algebra as a logical framework for equational specification. In: Parisi-Presicce F. (Ed). Recent Trends in Algebraic Development Techniques, 12th International Workshop. WADT'97, 3-7 June 1997, Tarquinia, Italy, Selected Papers. Lecture Notes in Computer Science vol. 1376 (1998), Springer-Verlag 18-61
44. Ölveczky P.C., and Meseguer J. Specification of real-time and hybrid systems in rewriting logic. Theoretical Computer Science 285 2 (2002) 359-405
45. Palomino M. Comparing Meseguer's rewriting logic with the logic CRWL. In: Hanus M. (Ed). International Workshop on Functional and (Constraint) Logic Programming. WFLP 2001, Selected Papers. Electronic Notes in Theoretical Computer Science vol. 64 (2001), Elsevier
46. Shankar N. Metamathematics, Machines, and Gödel's Proof (1994), Cambridge University Press
47. Shoenfield J.R. Degrees of Unsolvability (1971), North-Holland
48. Smullyan R.M. Theory of formal systems. Annals of Mathematics Studies (1961), Princeton University Press
49. M.-O. Stehr, Rewriting logic and type theory - From applications to unification, Ph.D. Thesis, Computer Science Department, University of Hamburg, Germany, 2002
50. Thati P., Sen K., and Martí-Oliet N. An executable specification of asynchronous pi-calculus. In: Gadducci F., and Montanari U. (Eds). Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA'02, 19-21 September 2002, Pisa, Italy. Electronic Notes in Theoretical Computer Science vol. 71 (2002), Elsevier
51. Turchin V.F. The concept of a supercompiler. ACM Transactions on Programming Languages and Systems 8 3 (1986) 292-325
52. Verdejo A., and Martí-Oliet N. Implementing CCS in Maude2. In: Gadducci F., and Montanari U. (Eds). Proceedings Fourth International Workshop on Rewriting Logic and its Applications. WRLA'02, 19-21 September 2002, Pisa, Italy. Electronic Notes in Theoretical Computer Science vol. 71 (2002), Elsevier
53. Wand M., and Friedman D.P. The mystery of the tower revealed. Lisp and Symbolic Computation 1 1 (1988) 11-38
54. In: Yonezawa A., and Matsuoka S. (Eds). Metalevel Architectures and Separation of Crosscutting Concerns: Third International Conference. REFLECTION 2001, 25-28 September 2001, Kyoto, Japan, Proceedings. Lecture Notes in Computer Science vol. 2192 (2001), Springer-Verlag