Abstract
The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to provide a semantic foundation for the object paradigm. This paper focuses on the coalgebraic aspect of hidden algebra, concerned with signatures of destructors at the syntactic level and with finality and cofree constructions at the semantic level. Our main result shows the existence of cofree constructions induced by maps between coalgebraic hidden specifications. Their use in giving a semantics to parameterised objects and inheritance is then illustrated. The cofreeness result for hidden algebra is generalised to abstract coalgebra and a universal construction for building object systems over existing subsystems is obtained. Finally, existence of final/cofree constructions for arbitrary hidden specifications is discussed.
Research supported by an ORS Award and an Oxford Bursary.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Diers. Familles universelles de morphismes. Annales de la Société Scientifique de Bruxelles, 93(3):175–195, 1979.
H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1: Equations and initial semantics. In EATCS Monographs on TCS. Springer, 1985.
J. Goguen and R. Diaconescu. Towards an algebraic semantics for the object paradigm. In H. Ehrig and F. Orejas, editors, Recent Trends in Data Type Specification, number 785 in LNCS. Springer, 1994.
J. Goguen and G. Malcolm. A hidden agenda. to appear, 1997.
B. Jacobs. Mongruences and cofree coalgebras. In V.S. Alagar and M. Nivat, editors, Algebraic Methods and Software Technology, number 936 in LNCS. Springer, 1995.
B. Jacobs. Inheritance and cofree constructions. In P. Cointe, editor,European Conference on Object-Oriented Programming, number 1098 in LNCS. Springer, 1996.
B. Jacobs. Invariants, bisimulations and the correctness of coalgebraic refinements. Technical Report CSI-R9704, University of Nijmegen, 1997.
B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62:222–259, 1997.
G. Malcolm. Behavioural equivalence, bisimilarity and minimal realisation. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specifications, number 1130 in LNCS. Springer, 1996.
G. Malcolm and J. Goguen. Proving correctness of refinement and implementation. Technical Monograph PRG-114, Oxford University, 1994.
H. Reichel. An approach to object semantics based on terminal coalgebras. Mathematical Structures in Computer Science, 5, 1995.
J. Rutten. A calculus of transition systems (towards universal coalgebra). Technical Report CS-R9503, CWI, 1995.
J. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, 1996.
D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Proceedings LICS, 1997.
J. Thatcher, E. Wagner, and J. Wright. Data type specification: Parameterization and the power of specification techniques. ACM Transactions on Programming Languages and Systems, 4(4), 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cîrstea, C. (1998). Coalgebra semantics for hidden algebra: Parameterised objects and inheritance. In: Presicce, F.P. (eds) Recent Trends in Algebraic Development Techniques. WADT 1997. Lecture Notes in Computer Science, vol 1376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64299-4_33
Download citation
DOI: https://doi.org/10.1007/3-540-64299-4_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64299-2
Online ISBN: 978-3-540-69719-0
eBook Packages: Springer Book Archive