Abstract
In a previous paper we characterized, in the Category Theory setting, a class of implementations of Abstract Data Types, which has been suggested by the way of programming in the EAT system. (EAT, Effective Algebraic Topology, is one of Sergeraert’s systems for effective homology and homotopy computation.) This characterization was established using classical tools, in an unrelated way to the current mainstream topics in the field of Algebraic Specifications. Looking for a connection with these topics, we have found, rather unexpectedly, that our approach is related to some object-oriented formalisms, namely hidden specifications and the coalgebraic view. In this paper, we explore these relations making explicit the implicit object-oriented features of the EAT system and generalizing the data structure analysis we had previously done.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
