Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
Journal of the ACM (JACM)
Higher-order functions considered unnecessary for higher-order programming
Research topics in functional programming
Topology and category theory in computer science
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Hiding and behaviour: an institutional approach
A classical mind
PolyP—a polytypic programming language extension
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement of parameterized algebraic specifications
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Theoretical Computer Science
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
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
Logical foundations of cafeOBJ
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
Design and Implementation of a Generic, Logic and Functional Programming Language
ESOP '86 Proceedings of the European Symposium on Programming
Initially-Restricting Algebraic Theories
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
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
What is an Abstract Data Type, after all?
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A Total Approach to Partial Algebraic Specification
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Advanced Functional Programming, Second International School-Tutorial Text
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
Algebraic Theory of Parameterized Specifications with Requirements
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Structured theories and institutions
Theoretical Computer Science
The algebraic structure of interfaces
Science of Computer Programming
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A sufficient completeness checker for linear order-sorted specifications modulo axioms
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Invariant-driven specifications in Maude
Science of Computer Programming
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The maude formal tool environment
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Tool interoperability in the Maude formal environment
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards a Maude formal environment
Formal modeling
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Using maude rewriting system to modularize and extend SQL
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Taming distributed system complexity through formal patterns
Science of Computer Programming
| Hi-index | 0.00 |
The reflective capabilities of rewriting logic and their efficient implementation in the Maude language can be exploited to endow a reflective language like Maude with a module algebra in which structured theories can be combined and transformed by means of a rich collection of module operations. We have followed this approach and have used the specification of such a module algebra as its implementation, including a user interface and an execution environment for it. The high level at which the specification of the module algebra has been given makes this approach particularly attractive when compared to conventional implementations, because of its shorter development time and the greater flexibility, maintainability, and extensibility that it affords. We explain the general principles of the reflective design of the module algebra and its categorical foundations, based on the institution-theoretic notion of structured theory and morphisms and colimits for such theories. Based on such foundations, we then explain the categorical semantics of Maude's parameterized theories, modules and views and their instantiation, and the reflective algebraic specification of the different module and view operations.