On fibred adjunctions and completeness for fibred categories
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
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
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
Verifying Behavioural Specifications in CafeOBJ Environment
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
| Hi-index | 0.00 |
Hidden algebra is a behavioural algebraic specification formalism for objects. It captures their constructional aspect, concerned with the initialisation and evolution of their states, as well as their observational aspect, concerned with the observable b ehaviour of such states. When attention is restricted to the observational aspect, final/cofree constructions provide suitable denotations for the specification techniques involved. However, when the constructional aspect is integrated with the observatio nal one, the presence of nondeterminism in specifications prevents the existence of final/cofree algebras. It is shown here that final/cofree families of algebras exist in this case, with each algebra in such a family resolving the nondetermi nism in a particular way. Existence of final/cofree families yields a canonical way of constructing algebras of structured specifications from algebras of the component specifications. Finally, a layered approach to specifying complex objects in hidden al gebra is presented, with the semantics still involving final/cofree families.