The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
The Go¨del programming language
The Go¨del programming language
Metamathematics, machines, and Go¨del's proof
Metamathematics, machines, and Go¨del's proof
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
The Art of the Metaobject Protocol
The Art of the Metaobject Protocol
A Generic Reification Technique for Object-Oriented Reflective Languages
Higher-Order and Symbolic Computation
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Object-Oriented Concurrent Reflective Architectures
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Communicating Concurrent Objects in HiddenCCS
Electronic Notes in Theoretical Computer Science (ENTCS)
A Declarative Debugger for Maude Functional Modules
Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with singular and plural non-deterministic functions
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
A Natural Implementation of Plural Semantics in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Parameterized metareasoning in membership equational logic
Formal modeling
An introduction to maude and some of its applications
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Test-Case generation for maude functional modules
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
A Tool for Testing Data Type Implementations from Maude Algebraic Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic security against web application attacks
Information Sciences: an International Journal
Taming distributed system complexity through formal patterns
Science of Computer Programming
| Hi-index | 5.23 |
We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These results provide logical foundations for reflective languages and tools based on these logics.