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
Unifying initial and loose semantics of parameterized specifications in an arbitrary institution
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Algebraic system specification and development
Algebraic system specification and development
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)
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Institutions for logic programming
Theoretical Computer Science - Special issue: algebraic development techniques
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
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
From Abstract Data Types to Logical Frameworks
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
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
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Parameterising (Algebraic) Specifications on Diagrams
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Towards a Toolkit for Actor System Specification
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
A specification language for coordinated objects
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
A language for configuring multi-level specifications
Theoretical Computer Science - Algebraic methodology and software technology
Science of Computer Programming
Invariant-driven specifications in Maude
Science of Computer Programming
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Taming distributed system complexity through formal patterns
Science of Computer Programming
Hi-index | 5.23 |
Category theory provides an excellent foundation for studying structured specifications and their composition. For example, theories can be structured together in a diagram, and their composition can be obtained as a colimit. There is, however, a growing awareness, both in theory and in practice, that structured theories should not be viewed just as the "scaffolding" used to build unstructured theories: they should become first-class citizens in the specification process. Given a logic formalized as an institution I, we therefore ask whether there is a good definition of the category of structured I-theories, and whether they can be naturally regarded as the ordinary theories of an appropriate institution J(I) generalizing the original institution I. We answer both questions in the affirmative, and study good properties of the institution I inherited by J(I). We show that, under natural conditions, a number of important properties are indeed inherited, including cocompleteness of the category of theories, liberality, and extension of the basic framework by freeness constraints. The results presented here have been used as a foundation for the module algebra of the Maude language, and seem promising as a semantic basis for a generic module algebra that could be both specified and executed within the logical framework of rewriting logic.