Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Good functors ... are those preserving philosophy!

  • Conference paper
  • First Online:
Category Theory and Computer Science

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

Abstract

The aim of this paper is to prevent the abstract data type researcher from an improper, naive use of category theory. We mainly emphasize some unpleasant properties of the synthesis functor when dealing with so-called loose semantics in a hierarchical approach. All our results and counter-examples are very simple, nevertheless they shed light on many common errors in the abstract specification field. We also summarize some properties of the category of models “protecting predefined sorts.”

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

8. References

  1. Goguen J., Thatcher J., Wagner E.: “An initial algebra approach to the specification, correctness, and implementation of abstract data types”, Current Trends in Programming Methodology, Vol.4, Yeh Ed. Prentice Hall, 1978. Also: IBM Report RC 6487, Oct. 1976.

    Google Scholar 

  2. Ehrig H., Kreowski H., Thatcher J., Wagner J., Wright J.: “Parameterized data types in algebraic specification languages”, Proc. 7th ICALP, July 1980.

    Google Scholar 

  3. Bernot G., Bidoit M., Choppy C.: “Abstract implementations and correctness proofs”, Proc. 3rd STACS, January 1986, Springer-Verlag LNCS 210, January 1986. Also: LRI Report 250, Orsay, Dec. 1985.

    Google Scholar 

  4. G. Bernot, M. Bidoit, C. Choppy: “Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors”, Theoretical Computer Science, Vol. 46, no 1, p. 13–45, November 1986.

    Google Scholar 

  5. Bernot G.: “Une sémantique algébrique pour une spécification différenciée des exceptions et des erreurs: application à l'implémentation et aux primitives de structuration des spécifications formelles”, Thèse de troisième cycle, LRI, Université de Paris-Sud, Orsay, Février 1986.

    Google Scholar 

  6. Bidoit M.: “Algebraic data types: structured specifications and fair presentations”, Proc. AFCET Symposium on Mathematics for Computer Science, Paris, March 1982.

    Google Scholar 

  7. Bidoit M.: “Algebraic specification of exception handling by means of declarations and equations”, Proc. 11th ICALP, Springer-Verlag LNCS 172, July 1984.

    Google Scholar 

  8. Broy M., Pair C., Wirsing M.: “A systematic study of models of abstract data types”, Theoretical Computer Sciences, p. 139–174, vol. 33, October 1984.

    Google Scholar 

  9. Broy M., Wirsing M.: “Partial abstract data types”, Acta Informatica, Vol.18-1, Nov. 1982.

    Google Scholar 

  10. Ehrig H., Kreowski H., Mahr B., Padawitz P.: “Algebraic implementation of abstract data types”, Theoretical Computer Science, Oct. 1980.

    Google Scholar 

  11. Ehrig H., Kreowski H., Padawitz P.: “Algebraic implementation of abstract data types: concept, syntax, semantics and correctness”, Proc. ICALP, Springer-Verlag LNCS 85, 1980.

    Google Scholar 

  12. Futatsugi K., Goguen J., Jouannaud J-P., Meseguer J.: “Principles of OBJ2”, Proc. 12th ACM Symp. on Principle of Programming Languages, New Orleans, January 1985.

    Google Scholar 

  13. Gaudel M-C.: “Spécifications incomplètes mais suffisantes de la représentation des types abstraits”, Laboria Report 320, 1978.

    Google Scholar 

  14. Gaudel M-C.: “A first introduction to PLUSS”, LRI Report, Orsay, December 1984.

    Google Scholar 

  15. Gogolla M., Drosten K., Lipeck U., Ehrich H.D.: “Algebraic and operational semantics of specifications allowing exceptions and errors”, Theoretical Computer Science 34, North Holland, 1984.

    Google Scholar 

  16. Guttag J.V., Horning J.J.: “An introduction to the LARCH shared language”, Proc. IFIP 83, REA Mason ed., North Holland Publishing Company, 1983.

    Google Scholar 

  17. Kamin S.: “Final data type specifications: a new data type specification method”, Proc. of the 7th POPL Conference, 1980.

    Google Scholar 

  18. Sannella D., Wirsing M.: “Implementation of parameterized specifications”, Report CSR-103-82, Department of Computer Science, University of Edinburgh.

    Google Scholar 

  19. Sannella D., Wirsing M.: “A kernel language for algebraic specification and implementation”, Proc. Intl. Conf. on Foundations of computation Theory, Springer-Verlag, LNCS 158, 1983.

    Google Scholar 

  20. Wirsing M.: “Structured algebraic specifications”, Proc. of AFCET Symposium on Mathematics for Computer Science, Paris, March 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique Bât 490, Université PARIS-SUD, F-91405, Orsay Cedex, France

    Gilles Bernot

Authors
  1. Gilles Bernot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David H. Pitt Axel Poigné David E. Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernot, G. (1987). Good functors ... are those preserving philosophy!. In: Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18508-9_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-18508-9_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18508-6

  • Online ISBN: 978-3-540-48006-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics