Skip to main content
SpringerLink
Log in

Specifying algebraic data types by domain equations

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

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

Included in the following conference series:

Abstract

The paper provides the theoretical foundation for a new algebraic specification method, using parameterized specifications and algebraic domain equations, an algebraic analogon to the domain equations used in Scott's theory of data types. The main result is that algebraic domain equations always have an initial solution. Also, a parametric version of algebraic domain equations is investigated. In either case, there is a simple syntactic solution method.

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. Goguen, J.A./Thatcher, J.W./Wagner, E.G./Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. Journal ACM 24,(1977), 68–95

    Google Scholar 

  2. Goguen,J.A./Thatcher,J.W./Wagner,E.G.: An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types.Current Trends in Programming Methodology,Vol IV (R.T. Yeh,ed.).Prentice Hall, Englewood Cliffs 1978, 80–149

    Google Scholar 

  3. Burstall, R.M./Goguen, J.A.: Putting Theories Together to Make Specifications. Proc. 5th Int. Joint Conf. on Artificial Intelligence, MIT, Cambridge (Mass.), 1977

    Google Scholar 

  4. Burstall, R.M./Goguen, J.A.: The Semantics of CLEAR, a Specification Language. Proc. 1979 Copenhagen Winter School on Abstract Software Specifications (D. Bjørner,ed.). LNCS 86, Springer-Verlag, Berlin 1980, 292–331

    Google Scholar 

  5. Ehrich, H.-D.: On The Theory of Specification, Implementation, and Parameterization of Abstract Data Types. Bericht Nr. 82/79, Abtlg. Informatik,Univ. Dortmund 1979 (also to appear in Journal ACM)

    Google Scholar 

  6. Ehrich, H.-D./Lohberger, V.G.: Parametric Specification of Abstract Data Types, Parameter Substitution, and Graph Replacements. Graphs, Data Structures, Algorithms (M. Nagl/H.-J. Schneider,eds.). Applied Computer Science 13,Hanser Verlag, München 1979, 169–182

    Google Scholar 

  7. Ehrich, H.-D./Lohberger, V.G.: Constructing Specifications of Abstract Data Types by Replacements. Proc. Int. Workshop on Graph Grammars and Their Application to Computer Science and Biology (V. Claus/H. Ehrig/G. Rozenberg,eds.). LNCS 73, Springer-Verlag, Berlin 1979,180–191

    Google Scholar 

  8. Ehrig, H./Kreowski, H.-J./Thatcher, J.W./ Wagner, E.G./Wright, J.B.: Parameterized Data Types in Algebraic Specification Languages. Proc. 7th ICALP (J.W. deBakker/J. van Leeuwen,eds.) LNCS 85, Springer-Verlag, Berlin 1980, 157–168

    Google Scholar 

  9. Ehrig,H./Kreowski,H.-J./Thatcher,J.W./Wagner,E.G./Wright,J.B.: Parameter Passing in Algebraic Specification Languages. Internal Report, FB 20 TU Berlin, 1980

    Google Scholar 

  10. Kanda,A.: Data Types as Initial Algebras: a Unification of Scottery and ADJery. Proc. 19th FOCS 1978, 221–230

    Google Scholar 

  11. Lehmann,D.J.: Categories for Fixpoint Semantics. Proc.7th FOCS 1976, 122–126

    Google Scholar 

  12. Lehmann,D.J./Smyth,M.B.:Data Types. Proc 18th FOCS 1977, 7–12

    Google Scholar 

  13. Scott, D.S.:The Lattice of Flow Diagrams.Proc.Symp. on Semantics of Algorithmic Languages (E. Engeler,ed.).LNM 188, Springer-Verlag, Berlin 1971, 311–372

    Google Scholar 

  14. Scott, D.S.: Lattice Theory,Data Types and Semantics.Formal Semanctics of Algorithmic Languages (R. Rustin,ed.).Prentice Hall, Englewood Cliffs 1972, 65–106

    Google Scholar 

  15. Scott, D.S.: Continuous Lattices. Toposes, Algebraic Geometry and Logic (F.W. Lawvere,ed.). LNM 274,Springer-Verlag, Berlin 1972,97–136

    Google Scholar 

  16. Scott, D.S.: Data Types as Lattices. SIAM Journal of Computing 5 (1976), 522–587

    Google Scholar 

  17. Smyth,M.B./Plotkin,G.D.: The Category-Theoretic Solution of Recursive Domain Equations. Proc. 18th FOCS 1977, 13–17

    Google Scholar 

  18. Wand, M.: On the Recursive Specification of Data Types. Proc. 1st Int. Coll. on Category Theory Applied to Computation and Control (E.G. Manes,ed.). LNCS 25, Springer-Verlag, Berlin 1975, 214–217

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abt. Informatik, Univ. Dortmund, PF 500500, D-4600, Dortmund 50

    H. -D. Ehrich

Authors
  1. H. -D. Ehrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrich, H.D. (1981). Specifying algebraic data types by domain equations. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation