Skip to main content

Hidden Specification of a Functional System

  • Conference paper
  • First Online:
Computer Aided Systems Theory — EUROCAST 2001 (EUROCAST 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2178))

Included in the following conference series:

Abstract

This paper is devoted to the formal study of the data structures appearing in a symbolic computation system, namely the EAT system. One of the main features of the EAT system is that it intensively uses functional programming techniques. This implies that some formalisms for the algebraic specification of systems must be adapted to this functional setting. Specifically, this work deals with hidden and coalgebraic methodologies through an institutional framework. As a byproduct, the new concept of coalgebraic institution associated to an institution is introduced. Then, the problem of modeling functorial relationships between data structures is tackled, giving a hidden specification for this aspect of the EAT system and proving the existence of final objects in convenient categories, which accurately model the EAT way of working.

Partially supported by DGES, project PB98-1621-C02-01 and by Universidad de La Rioja, project API-00/B28

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abbadi, L. Cardelli, A Theory of objects, Springer, 1996.

    Google Scholar 

  2. R. Burstall, R. Diaconescu, Hiding and behaviour: an institutional approach, in A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice-Hall (1994) 75–92.

    Google Scholar 

  3. C. Cîrstea, Coalgebra semantics for hidden algebra: parameterised objects and inheritance, Lecture Notes in Computer Science 1376 (1997) 174–189.

    Google Scholar 

  4. C. Domínguez, J. Rubio,Modeling inheritance as coercion in a symbolic computation system, in Proceedings ISSAC’2001, ACM Press (2001).

    Google Scholar 

  5. J. Goguen, R. Burstall, Institutions: Abstract model theory for specification and programming, Journal of the Association for Computing Machinery 39(1) (1992) 95–146.

    MATH  MathSciNet  Google Scholar 

  6. J. Goguen, R. Diaconescu, Towards an algebraic semantics for the object paradigm, Lecture Notes in Computer Science 785 (1994) 1–29.

    Google Scholar 

  7. J. Goguen, G. Malcolm, A hidden agenda, Theoretical Computer Science 245 (2000) 55–101.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Hudak, S.L. Peyton Jones, P. Wadler, et al. Report on the functional language Haskell: a non-strict, purely functional language, Version 1.2., SIGPLAN Notices 27(5) (1992) Ri-Rxii, R1-R164.

    Google Scholar 

  9. B. Jacobs, J. Rutten, A tutorial on (co)algebras and (co)induction, EATCS Bulletin 62 (1997) 222–259.

    MATH  Google Scholar 

  10. L. Lambán, V. Pascual, J. Rubio, Specifying implementations, in Proceedings ISSAC’ 99, ACM Press (1999) 245–251.

    Google Scholar 

  11. L. Lambán, V. Pascual, J. Rubio, An object-oriented interpretation of the EAT system. Preprint.

    Google Scholar 

  12. J. Loeckx, H. D. Ehrich, M. Wolf, Specification of Abstract Data Types, Wiley-Teubner, 1996.

    Google Scholar 

  13. J. P. May, Simplicial Objects in Algebraic Topology, Van Nostrand, 1967.

    Google Scholar 

  14. J. Rubio, F. Sergeraert, Locally effective objects and Algebraic Topology, in Computational Algebraic Geometry, Birkhäuser (1993) 235–251.

    Google Scholar 

  15. J. Rubio, F. Sergeraert, Y. Siret, EAT: Symbolic Software for Effective Homology Computation, http://ftp://fourier.ujf-grenoble.fr/pub/EAT, Institut Fourier, Grenoble, 1997.

    Google Scholar 

  16. F. Sergeraert, Y. Siret, Kenzo: Symbolic Software for Effective Homology Computation, http://ftp://fourier.ujf-grenoble.fr/pub/KENZO, Institut Fourier, Grenoble, 1999.

    Google Scholar 

  17. G. Steele Jr., Common Lisp. The language, Second Edition, Digital Press (1990).

    Google Scholar 

  18. J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science 249 (2000) 3–80.

    Article  MATH  MathSciNet  Google Scholar 

  19. P. Wadler, S. Blott, How to make ad hoc polymorphism less ad hoc, in Proceedings of the 16th ACM Symposium on Principles of Programming Languages (1989) 60–76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domínguezand, C., Lambán, L., Pascual, V., Rubio, J. (2001). Hidden Specification of a Functional System. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45654-6_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42959-3

  • Online ISBN: 978-3-540-45654-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics