Skip to main content
SpringerLink
Log in

Bits and pieces of the theory of institutions

  • Part II Research Contributions
  • Chapter
  • First Online:
Book cover Category Theory and Computer Programming

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

"There has been a population explosion among the logical systems used in computer science ..." J.A. Goguen & R.M. Burstall 1984.

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.

References

  1. ADJ: Goguen, J.A., Thatcher, J.W., and Wagner, E. An initial algebra approach to the specification, correctness and implementation of abstract data types, in: Current Trends in Programming Methodology, vol.4: Data Structuring, ed. R.T. Yeh, pp. 80–149, Prentice-Hall 1978.

    Google Scholar 

  2. ADJ: Goguen, J.A., Thatcher, J.W., Wagner, E., and Wright, J.B. Initial algebra semantics and continuous algebras, JACM 24(1977), pp. 68–95.

    Google Scholar 

  3. Barwise, J. Axioms for abstract model theory, Annals of Mathematical Logic 7(1974), pp. 221–165.

    Google Scholar 

  4. Bergstra, J.A., and Tucker, J.V. Top-down design and the algebra of communicating processes, Report CS-R8401, CWI, Amsterdam.

    Google Scholar 

  5. Burstall, R.M., and Goguen, J.A. Putting theories together to make specifications, Proc. 5th Intl. Joint Conference on Artificial Intelligence 5(1877), pp.1045–1058.

    Google Scholar 

  6. Burstall, R.M., and Goguen, J.A. The semantics of Clear, a specification language, Proc. Copenhagen Winter School on Abstract Software Specification, LNCS 86, pp. 292–332, Springer 1980.

    Google Scholar 

  7. Burstall, R.M. and Goguen, J.A. Algebras, theories and freeness: an introduction for computer scientists, Proc. 1981 Marktoberdorf NATO Summer School, Reidel 1982.

    Google Scholar 

  8. Chang, C.C. and Keisler, H.J. Model Theory, North Holland, Amsterdam 1973.

    Google Scholar 

  9. Ehrich, H.-D. On the theory of specification, implementation and parameterization of abstract data types, JACM 19(1982), pp. 206–227.

    Google Scholar 

  10. Ehrig, H., Fey, W. and Hansen, H. ACT ONE: an algebraic specification language with two-level semantics, Report Nr. 83-03, Institut fur Software und Theoretische Informatik, Technische Universitat Berlin.

    Google Scholar 

  11. Ehrig, H. and Mahr, B. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, Springer 1985.

    Google Scholar 

  12. Ehrig, H., Wagner, E. and Thatcher, J.W. Algebraic specifications with generating constraints, Proc. 10th ICALP, LNCS 154, pp. 188–202, Springer 1983.

    Google Scholar 

  13. Goguen, J.A. Mathematical representation of hierarchically organized systems, Global Systems Dynamics, ed. E. Attinger, pp. 112–128, S. Karger 1971.

    Google Scholar 

  14. Goguen, J.A. and Burstall, R.M. Introducing institutions, Proc. Logics of Programming Workshop, eds. E. Clarke and D. Kozen, LNCS 164, pp. 221–256, Springer 1984.

    Google Scholar 

  15. Goguen, J.A. and Burstall, R.M. Some fundamental algebraic tools for the semantics of computation, part 1: comma categories, colimits, signatures and theories, TCS 31(1984), pp. 263–295.

    Google Scholar 

  16. Goguen, J.A. and Burstall, R.M. Institutions: abstract model theory for computer science, extended version of [GB 84a], unpublished report, SRI international, Menlo Park 1985.

    Google Scholar 

  17. Goguen, J.A., Jouannaud, J.-P. and Meseguer, J. Operational semantics for order-sorted algebras, Proc. 12th ICALP, LNCS 194, Springer 1985.

    Google Scholar 

  18. Gratzer, G. Universal Algebra, 2nd edition, Springer 1979.

    Google Scholar 

  19. Guttag, J.V. and Horning, J.J. Formal specification as a design tool, Proc. ACM Symp. Principles of Programming Languages, Las Vegas, pp. 251–261, ACM 1980.

    Google Scholar 

  20. Guttag, J.V., Horning, J.J. and Wing, J. Larch in five easy pieces, Report #5, Systems Research Center, DEC 1985.

    Google Scholar 

  21. Liskov, B. and Berzins, V. An appraisal of program specifications, Computation Structures Group memo 141-1, Laboratory for Computer Science, MIT 1977.

    Google Scholar 

  22. MacLane, S. Categories for the Working Mathematician, Springer 1971.

    Google Scholar 

  23. Mahr, B. and Makowsky, J.A. Characterizing specification languages which admit initial semantics, TCS 31(1984), pp. 49–60.

    Google Scholar 

  24. Milner, R.G. A proposal for Standard ML. Proc. 1984 ACM Symp. on LISP and Functional Programming, Austin, Texas.

    Google Scholar 

  25. Reichel, H. Initially restricting algebraic theories, Proc. MFCS'80, ed. P. Dembinski, LNCS 88, pp. 504–514, Springer 1980.

    Google Scholar 

  26. Sadler, M. Mapping out specification, position paper, Workshop on Formal Aspects of Specification, Swindon 1984.

    Google Scholar 

  27. Sannella, D.T. and Burstall, R.M. Structured theories in LCF, Proc. Colloq. Trees in Algebra and Programming CAAP' 83, LNCS 159, pp. 377–391, Springer 1983.

    Google Scholar 

  28. Sannella, D.T. and Tarlecki, A. Building specifications in an arbitrary institution, Proc. Intl. Symp. Semantics of Data Types, eds. G. Kahn, D. MacQueen and G. Plotkin, LNCS 173, pp. 337–356, Springer 1984.

    Google Scholar 

  29. Sannella, D.T. and Tarlecki, A. Some thoughts on algebraic specification, Proc. 3rd Workshop on Theory and Applications of Abstract Data Types, Bremen 1984, ed. H.-J. Kreowski, Springer, to appear.

    Google Scholar 

  30. Sannella, D.T. and Tarlecki, A. Program specification and development in Standard ML, Proc. 12th ACM Symp. Principles of Programming Languages, New Orleans, pp. 67–77, ACM 1985.

    Google Scholar 

  31. Sannella, D.T. and Tarlecki, A. On observational equivalence and algebraic specification, JCSS, to appear; extended abstract in Proc. TAPSOFT' 85, CAAP' 85, eds. H. Ehrig, C. Floyd, M. Nivat and J. Thatcher, LNCS 185, pp. 308–322, Springer 1985.

    Google Scholar 

  32. Sannella, D.T. and Tarlecki, A. Specifications in an arbitrary institution, Information and Control, to appear.

    Google Scholar 

  33. Sannella, D.T. and Tarlecki, A. Extended ML: an institution-independent framework for formal program development, this volume.

    Google Scholar 

  34. Sannella, D.T. and Wirsing, M. A kernel language for algebraic specification and implementation, Proc. Intl. Conf. Foundations of Computation Theory, LNCS 158, pp. 413–427, Springer 1983.

    Google Scholar 

  35. Tarlecki, A. Quasi-varieties in abstract algebraic institutions, Report CSR-173-84, Dept. of Computer Science, Univ. of Edinburgh.

    Google Scholar 

  36. Tarlecki, A. On the existence of free models in abstract algebraic institutions, TCS 37 (1985), No.3.

    Google Scholar 

  37. Tarlecki, A. and Wirsing, M. Continuous abstract data types, Fundamenta Informaticae, to appear; extended abstract in FCT' 85, ed. L. Budach, LNCS 199, pp. 431–441, Springer 1985.

    Google Scholar 

  38. Wirsing, W. Structured algebraic specifications, Proc. AFCET Symp. Mathematics for Computer Science, Paris, pp. 93–107.

    Google Scholar 

  39. Zilles, S.N., Lucas, P. and Thatcher, J.W. A look at algebraic specifications, IBM research report RJ 3568.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Andrzej Tarlecki

Authors
  1. Andrzej Tarlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt Samson Abramsky Axel Poigné David Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tarlecki, A. (1986). Bits and pieces of the theory of institutions. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds) Category Theory and Computer Programming. Lecture Notes in Computer Science, vol 240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17162-2_132

Download citation

  • DOI: https://doi.org/10.1007/3-540-17162-2_132

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17162-1

  • Online ISBN: 978-3-540-47213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation