The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Reflecting the semantics of reflected proof
Proof theory
The Go¨del programming language
The Go¨del programming language
General logics and logical frameworks
What is a logical system?
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
Maude: specification and programming 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
Reflection and semantics in LISP
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
The Art of the Interpreter or, The Modularity Complex (Parts Zero, One, and Two)
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Semantic Models for Distributed Object Reflection
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Science of Computer Programming
Policy-based Coordination in PAGODA: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Declarative Debugging of Membership Equational Logic Specifications
Concurrency, Graphs and Models
Proof Search for the First-Order Connection Calculus in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Modal Properties of Rewrite Theories Using Maude's Metalevel
Electronic Notes in Theoretical Computer Science (ENTCS)
The Polymorphic Rewriting-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls
Electronic Notes in Theoretical Computer Science (ENTCS)
Validating Behavioral Component Interfaces in Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Mapping modular SOS to rewriting logic
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Validating Behavioral Component Interfaces in Rewriting Logic
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Hi-index | 0.00 |
We recall general metalogical axioms for a reflective logic based on the notion of a universal theory, that is, a theory that can simulate the deductions of all other theories in a class of theories of interest, including itself. We then show that conditional rewriting logic is reflective, generalizing in two stages: first to the unsorted conditional case, and then to the many-sorted conditional case, the already known result for unconditional and unsorted rewriting logic (Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, 2000). This work should be seen as providing foundations for many useful applications of rewriting logic reflection. The results presented here have greatly influenced the design of the Maude language, which implements rewriting logic and supports its reflective capabilities, and have been used as a theoretical foundation for applications such as internal rewrite strategies, reflective design of theorem proving tools, module algebra and metaprogramming, and metareasoning in metalogical frameworks.