Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Coalgebra semantics for hidden algebra: Parameterised objects an inheritance
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Correctness of a logical system for structured specifications
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Swinging Data Types: Syntax, Semantics, and Theory
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Behavioural Equivalence, Bisimulation, and Minimal Realisation
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Mongruences and Cofree Coalgebras
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Proving Behavioural Theorems with Standard First-Order Logic
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Initial algebra and final coalgebra semantics for concurrency.
Initial algebra and final coalgebra semantics for concurrency.
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Hi-index | 5.23 |
We present an algebraic extension of standard coalgebraic specification techniques for state-based systems which allows us to integrate constants and n-ary operations in a smooth way and which leads to institutions enabling the use of modular specification techniques. A sound and complete proof system for first-order observational properties of modular specifications is given. The framework of (,)-structures that we present can be considered as the result of a transformation of concepts of observational logic as in Hennicker and Bidoit (in: A. Haeberer (Ed.), Algebraic Methodology and Software Technology (AMAST'98), Lecture Notes in Computer Science, vol. 1548, Springer, Berlin, 1999) into the coalgebraic world. Moreover, it is shown that the features of (,)-structures that make them suitable models for an observational approach to specifications can be categorically expressed by the fact that the operation mapping an (,)-structure to its behaviour is a fibred idempotent monad.