Skip to main content

Mutually recursive algebraic domain equations

  • Foundations And Theory
  • Conference paper
  • First Online:
VDM '88 VDM — The Way Ahead (VDM 1988)

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

Included in the following conference series:

  • 126 Accesses

Abstract

A theory of mutually recursive algebraic domain equations is developed. The theory may provide algebraic interpretation of domain equations as known from VDM's specification language Meta-IV. A set of mutually recursive algebraic domain equations is roughly spoken a set of parameterized algebraic specifications applying instances of each other in a recursive fashion. A solution to a set of algebraic domain equations can be constructed by using a new parameter passing technique called recursive parameter passing. It is sketched how the theory makes sense under an arbitrary institution.

Address from May 1988: Dansk Datamatik Center, Lundtoftevej 1C, DK-2800 Lyngby, Denmark.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. A. Arbib and E. G. Manes. Arrows, Structures and Functors, The Categorical Imperative. Academic Press, Inc., 1975.

    Google Scholar 

  2. D. Bjørner and C. B. Jones. Formal Specification and Software Development. Prentice-Hall International, Inc., 1982.

    Google Scholar 

  3. H-D. Ehrich and U. Lipeck. Algebraic domain equations. Theoretical Computer Science, (27):167–196, 1983.

    Google Scholar 

  4. H. Ehrig and E. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, 1985.

    Google Scholar 

  5. J.A. Goguen and R.M. Burstall, Institutions: Abstract Model Theory for Computer Science. SRI International, 1985.

    Google Scholar 

  6. J.A. Goguen, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Initial Algebra Semantics and Continuous Algebras. Journal of Association Computing Machinery, (24):68–95, 1977.

    Google Scholar 

  7. A. E. Haxthausen. Meta-IV in an Algebraic Framework. Technical Report, Department of Computer Science, Technical University of Denmark, December 1986. Revised April 1988.

    Google Scholar 

  8. A. E. Haxthausen. Mutually recursive algebraic specifications. 1988. To appear.

    Google Scholar 

  9. A. E. Haxthausen. Structuring Mechanisms in Formal Specification Languages. Technical Report, Department of Computer Science, Technical University of Denmark, May 1988.

    Google Scholar 

  10. B. Möller and W. Dosch. On the algebraic specification of domains. In Proceedings of 3rd Workshop on Specification of Abstract Data Types, Bremen, 1984.

    Google Scholar 

  11. D. Sannella and A. Tarlecki. Specifications in an Arbitrary Institution. Technical Report, Department of Computer Science, University of Edinburgh, 1985.

    Google Scholar 

  12. J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robin E. Bloomfield Lynn S. Marshall Roger B. Jones

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haxthausen, A.E. (1988). Mutually recursive algebraic domain equations. In: Bloomfield, R.E., Marshall, L.S., Jones, R.B. (eds) VDM '88 VDM — The Way Ahead. VDM 1988. Lecture Notes in Computer Science, vol 328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50214-9_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-50214-9_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50214-2

  • Online ISBN: 978-3-540-45955-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics