Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2003: Computer Science Logic pp 299–313Cite as

On Algebraic Specifications of Abstract Data Types

  • Conference paper

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

Abstract

In this paper we address long standing open problems of Bergstra and Tucker about specifications of abstract data types by means of equations and conditional equations. By an abstract data type we mean the isomorphism type of an algebra. An algebra is algebraically specified if the algebra can be defined uniquely, in a certain precise sense, in terms of a finite number of conditional equations by allowing functions that are not in the original language of the algebra. We provide full solutions to Bergtsra and Tucker problems, explain basic ideas, methods, and the logical dependencies between blocks of proofs used in our solutions.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergstra, J., Tucker, J.: Initial and final algebra semantics for data type specifications: two characterisation theorems. SIAM Journal on Computing 12(2), 366–387 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bergstra, J., Tucker, J.: Algebraic Specifications of Computable and Semicomputable Data Types. Theoretical Computer Science 50, 137–181 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bergstra, J., Tucker, J.: The Completeness of the Algebraic Specification Methods for Computable Data Types. Information and Control 54(3), 186–200 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Goncharov, S., Khoussainov, B.: Computationally Complete Algebras, CDMTCS Research report, No 206, see Research Report Series in http://www.cs.auckland.ac.nz/CDMTCS/

  5. Grätzer, G.: Universal Algebra, 2nd edn. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  6. Ershov, Y., Goncharov, S.: Constructive Models. Siberian School of Algebra and Logic Series. Consultants Bureau. Kluwer Academic, Plenum (2000)

    Google Scholar 

  7. Kasymov, N.: Algebras with Finitely Approximable Positively Representable Enrichments. Algebra and Logic 26(6), 715–730 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kasymov, N., Khoussainov, B.: Finitely Generated Enumerable and Absolutely Locally Finite Algebras. Vychisl. Systemy (116), 3–15 (1986)

    MATH  MathSciNet  Google Scholar 

  9. Khoussainov, B.: Randomness, Computability, and Algebraic Specifications. Annals of Pure and Applied Logic 91(1), 1–15 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sannella, D., Tarlecki, A.: Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing 9, 229–269 (1997)

    Article  MATH  Google Scholar 

  11. Soare, R.: Recursively Enumerable Sets and Degrees. Springer, New York (1987)

    Google Scholar 

  12. Wirsing, M.: Algebraic Specifications. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Model and Semantics, vol. B, pp. 675–788. Elsevier, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The University of Auckland, New Zealand

    Bakhadyr Khoussainov

Authors
  1. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Discrete Mathematics and Geometry, Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040, Wien, Austria

    Matthias Baaz

  2. Members of EACSL Jury for the Ackermann Award,  

    Johann A. Makowsky

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khoussainov, B. (2003). On Algebraic Specifications of Abstract Data Types. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45220-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40801-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation