Object oriented institutions to specify symbolic computation systems

César Domínguez; Laureano Lambán; Julio Rubio

RAIRO - Theoretical Informatics and Applications (2007)

  • Volume: 41, Issue: 2, page 191-214
  • ISSN: 0988-3754

Abstract

top
The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational algebraic institution, in a hidden institution or in a coalgebraic institution. Moreover, these morphisms can be used to obtain a new description of the final objects of the categories of algebras in these frameworks, which are suitable abstract models for the EAT data structures. Thus, our main contribution is a formalization allowing us to encode a family of data structures by means of a single algebra (which can be described as a coproduct on the image of the institution morphisms). With this aim, new particular definitions of hidden and coalgebraic institutions are presented.

How to cite

top

Domínguez, César, Lambán, Laureano, and Rubio, Julio. "Object oriented institutions to specify symbolic computation systems." RAIRO - Theoretical Informatics and Applications 41.2 (2007): 191-214. <http://eudml.org/doc/250045>.

@article{Domínguez2007,
abstract = { The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational algebraic institution, in a hidden institution or in a coalgebraic institution. Moreover, these morphisms can be used to obtain a new description of the final objects of the categories of algebras in these frameworks, which are suitable abstract models for the EAT data structures. Thus, our main contribution is a formalization allowing us to encode a family of data structures by means of a single algebra (which can be described as a coproduct on the image of the institution morphisms). With this aim, new particular definitions of hidden and coalgebraic institutions are presented. },
author = {Domínguez, César, Lambán, Laureano, Rubio, Julio},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Institution; symbolic computation; specification; object orientation},
language = {eng},
month = {7},
number = {2},
pages = {191-214},
publisher = {EDP Sciences},
title = {Object oriented institutions to specify symbolic computation systems},
url = {http://eudml.org/doc/250045},
volume = {41},
year = {2007},
}

TY - JOUR
AU - Domínguez, César
AU - Lambán, Laureano
AU - Rubio, Julio
TI - Object oriented institutions to specify symbolic computation systems
JO - RAIRO - Theoretical Informatics and Applications
DA - 2007/7//
PB - EDP Sciences
VL - 41
IS - 2
SP - 191
EP - 214
AB - The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational algebraic institution, in a hidden institution or in a coalgebraic institution. Moreover, these morphisms can be used to obtain a new description of the final objects of the categories of algebras in these frameworks, which are suitable abstract models for the EAT data structures. Thus, our main contribution is a formalization allowing us to encode a family of data structures by means of a single algebra (which can be described as a coproduct on the image of the institution morphisms). With this aim, new particular definitions of hidden and coalgebraic institutions are presented.
LA - eng
KW - Institution; symbolic computation; specification; object orientation
UR - http://eudml.org/doc/250045
ER -

References

top
  1. M. Barr and Ch. Wells, Category Theory for Computer Science. Prentice Hall International (1995).  
  2. M. Bidoit and R. Hennicker, Constructor-based observational logic. Technical Report LSV-03-9, Lab. Specification et Verification, ENS de Cachan, Cachan, France (2003).  
  3. R.M. Burstall, R. Diaconescu, Hiding and behaviour: an institutional approach, in A Classical Mind: Essays in Honour of C.A.R. Hoare, edited by A. William Roscoe. Prentice-Hall, Englewood Cliffs, NJ (1994) 75–92.  
  4. J. Calmet and I.A. Tjandra, A unified-algebra-based specification language for symbolic computing, in Design and Implementation of Symbolic Computation Systems (DISCO'93), edited by A. Miola, Springer, Berlin. Lect. Notes Comput. Sci.722 (1993) 122–133.  
  5. J. Calmet, K. Homann and I.A. Tjandra, Unified domains and abstract computational structures, in Artificial Intelligence and Symbolic Mathematical Computation (AISMC'92), edited by J. Calmet and J.A. Campbell, Springer, Berlin. Lect. Notes Comput. Sci.737 (1993) 166–177.  
  6. C. Cîrstea, Coalgebra semantics for hidden algebra: parameterised objects and inheritance, in Recent Trends in Algebraic Development Techniques, edited by F. Parisi-Presicce, Springer, Berlin. Lect. Notes Comput. Sci.1376 (1998) 174–189.  
  7. C. Cîrstea, A coalgebraic equational approach to specifying observational structures. Theoret. Comput. Sci.280 (2002) 35–68.  
  8. A. Corradini, A completeness result for equational deduction in coalgebraic specification, in Recent Trends in Algebraic Development Techniques, edited by F. Parisi-Presicce, Springer, Berlin. Lect. Notes Comput. Sci.1376 (1998) 190–205.  
  9. C. Domínguez, J. Rubio, Modeling inheritance as coercion in a symbolic computation system, in International Symposium on Symbolic and Algebraic Computation (ISSAC'2001), edited by B. Mourrain, ACM Press (2001) 107–115.  
  10. C. Domínguez, L. Lambán, V. Pascual and J. Rubio, Hidden specification of a functional system, in Computer Aided Systems Theory (EUROCAST'2001), edited by R. Moreno-Díaz, B. Buchberger, J.L. Freire, Springer, Berlin. Lect. Notes Comput. Sci.2178 (2001) 555–569.  
  11. X. Dousson, F. Sergeraert and Y. Siret, The Kenzo program, Institut Fourier, Grenoble, (1999), Available at  URIhttp://www-fourier.ujf-grenoble.fr/~sergerar/Kenzo
  12. D. Duval, Diagrammatic Specifications. Math. Structures Comput. Sci.13 (2003) 857–890.  
  13. J.A. Goguen and R.M. Burstall, Institutions: Abstract model theory for specification and programming. J. ACM39 (1992) 95–146.  
  14. J.A. Goguen and R. Diaconescu, Towards an algebraic semantics for the object paradigm, in Recent Trends in Data Type Specification, edited by H. Ehrig and F. Orejas Springer, Berlin. Lect. Notes Comput. Sci.785 (1994) 1–29.  
  15. J.A. Goguen and G. Malcolm, A hidden agenda. Theoret. Comput. Sci.245 (2000) 55–101.  
  16. J.A. Goguen, G. Roşu, Hiding more of hidden algebra, in Formal Methods (FM'99), edited by J.M. Wing, J. Woodcook, J. Davies, Springer, Berlin. Lect. Notes Comput. Sci.1709, (1999) 1704–1719.  
  17. J.A. Goguen and G. Roşu, Institution morphisms. Form. Asp. Comput.13 (2002) 274–307.  
  18. J.A. Goguen, G. Malcolm and T. Kemp, A hidden herbrand theorem: combining the object and logic paradigms. J. Log. Algebr. Program.51 (2002) 1–41.  
  19. R. Hennicker and M. Bidoit, Observational logic, in Algebraic Methodology and Software Technology (AMAST'98), edited by A.M. Haeberer, Springer, Berlin. Lect. Notes Comput. Sci.1584 (1999) 263–277.  
  20. A. Kurz and R. Hennicker, On institutions for modular coalgebraic specifications. Theoret. Comput. Sci.280 (2002) 69–103.  
  21. L. Lambán, V. Pascual and J. Rubio, Specifying implementations, in International Symposium on Symbolic and Algebraic Computation (ISSAC'99), edited by S. Dooley. ACM Press, (1999) 245–251.  
  22. L. Lambán, V. Pascual and J. Rubio, An object-oriented interpretation of the EAT system, Applicable Algebra in Engineering, Comm. Comput.14 (2003) 187–215.  
  23. J. Loeckx, H.D. Ehrich and M. Wolf, Specification of Abstract Data Types. Wiley and Teubner, New York (1996).  
  24. J. Rubio, F. Sergeraert, Constructive algebraic topology. Bull. Sci. Math.126 (2002) 389–412.  
  25. J. Rubio, F. Sergeraert and Y. Siret, EAT: Symbolic Software for Effective Homology Computation, Institut Fourier, Grenoble, 1997. Available at ftp://fourier.ujf-grenoble.fr/pub/EAT  
  26. J. Rubio, F. Sergeraert and Y. Siret, Overview of EAT, a System for Effective Homology Computation. The SAC Newsletter3 (1998) 69–79.  
  27. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Theoret. Comput. Sci.249 (2000) 3–80.  
  28. A. Tarlecki, Towards heterogeneous specifications, in Frontiers of Combinig Systems (FroCos'98), Research Studies Press/Wiley, edited by D.M. Gabbay, M. de Rijke. Stud. Logic Comput.7 (2000) 337–360.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.