Skip to main content

Partial algebras flow from algebraic specifications

  • Petri Nets, Algebraic Specification
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1987)

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

Included in the following conference series:

Abstract

The aim of this paper is to introduce and to investigate a method for specifying algebras with partial functions, while maintaining the simpler framework of total algebras and conventional specifications. For this purpose, an ordinary algebraic specification SPEC is equipped with a subspecification BASE, and each SPEC-algebra is equipped with a BASE-homomorphism distinguishing a BASE-part of the SPEC-algebra. These modifications, yielding the notions of based specification and of based algebra, do not seriously affect the semantic properties of algebraic specifications. In particular, the initial SPEC-algebra can simply be transformed into an initial based algebra. Then one can restrict a SPEC-algebra to its distinguished BASE-part. In this way, one gets a SPEC-algebra with operations that may be partial. The construction applies especially to the initial based algebra, the operations of which can be shown to be computable in a certain sense. Conversely, it turns out that each computable function on natural numbers can be specified as an operation of the initial based algebra of a based specification.

The work was partly done while I participated in the IBM World Trade Visiting Faculty Program at the Thomas J. Watson Research Center in Yorktown Heights, New York.

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.

References

  1. M. Broy, P. Pepper, M. Wirsing: On the Algebraic Definition of Programming Languages, to appear in TOPLAS.

    Google Scholar 

  2. M. Broy, M. Wirsing: Partial Abstract Types, Acta Informatica 18 (1982), 47–64.

    Article  Google Scholar 

  3. P. Burmeister: Free partial algebras, J. reine u. angewandte Math. 241 (1970), 75–86.

    Google Scholar 

  4. P. Burmeister: Quasi-Equational Logic for Partial Algebras, Lect. Notes in Comp. Sci. 117 (1981), 71–80.

    Google Scholar 

  5. H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1 — Equations and Initial Semantics, Springer (1985).

    Google Scholar 

  6. J.A. Goguen, K. Parsaye-Ghomi: Algebraic Denotational Semantics Using Parameterized Abstract Modules, Lect. Not. Comp. Sci. 107 (1981), 292–309.

    Google Scholar 

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

    Google Scholar 

  8. G. Grätzer: Universal Algebra, Princeton, van Nostrand (1968).

    Google Scholar 

  9. J.V. Guttag: The Specification and Application to Programming of Abstract Data Types, Ph.D. Thesis, University of Toronto (1975).

    Google Scholar 

  10. C.A.R. Hoare: Proof of Correctness of Data Representations, Acta Informatica 1 (1972), 271–281.

    Article  Google Scholar 

  11. H. Höft: Weak and Strong Equations in Partial Algebras, Algebra universalis 3 (1973), 203–215.

    Google Scholar 

  12. R. John: Gültigkeitsbegriffe für Gleichungen in partiellen Algebren, Math. Zeitschrift 159 (1978), 25–35.

    Article  Google Scholar 

  13. A.J. Kfoury, R.N. Moll, M.A. Arbib: A Programming Approach to Computability, Springer (1982).

    Google Scholar 

  14. H. Klaeren: Algebraische Spezifikation — eine Einführung, Springer (1983).

    Google Scholar 

  15. H.-J. Kreowski, H.W. Schmidt: Some Algebraic Concepts of the Specification Language SEGRAS and Their Initial Semantics, GMD-Studie Nr.93 (1984).

    Google Scholar 

  16. P. Mosses: A Basic Abstract Semantic Algebra, Lect. Not. Comp.Sci. 173 (1984), 87–104.

    Google Scholar 

  17. H. Reichel: Theorie der Äquoide, Dissertation B, Humboldt University, Berlin 1979.

    Google Scholar 

  18. H. Reichel: Structural Induction on Partial Algebras, Mathematical Research · Mathematische Forschung Band 18, Akademie-Verlag, Berlin 1984.

    Google Scholar 

  19. J. Schmidt: A General Existence Theorem on Partial Algebras and its Special Cases, Coll. Math.14 (1966), 73–87.

    Google Scholar 

  20. J. Slomiński: Peano-Algebras and Quasi-Algebras, Dissertationes Math. 62 (1968).

    Google Scholar 

  21. J.W. Thatcher, E.G. Wagner, J.B. Wright: More on Advice on Structuring Compilers and Proving Them Correct, Theoretical Computer Science 15 (1981), 223–249.

    Article  Google Scholar 

  22. J.W. Thatcher, E.G. Wagner, J.B. Wright: Data Type Specification: Parameterization and the Power of Specification Techniques, ACM TOPLAS 4 (1982), 711–732.

    Article  Google Scholar 

  23. S. Zilles: Algebraic Specification of Data Types, MIT-Proj. MAC Progr.Rep.11(1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreowski, HJ. (1987). Partial algebras flow from algebraic specifications. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics