Skip to main content
SpringerLink
Log in

A characterisation of computable data types by means of a finite equational specification method

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

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

Included in the following conference series:

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. BERGSTRA, J.A. & J.V. TUCKER, Algebraic specifications of computable and semi-computable data structures, Mathematical Centre, Department of Computer Science Research Report IW 115, Amsterdam, 1979.

    Google Scholar 

  2. —, A characterisation of computable data types by means of a finite, equational specification method, Mathematical Centre, Department of Computer Science Research Report IW 124, Amsterdam, 1979.

    Google Scholar 

  3. —, Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds, Mathematical Centre, Department of Computer Science Research Report IW 128, Amsterdam, 1980.

    Google Scholar 

  4. —, On bounds for the specification of finite data types by means of equations and conditional equations, Mathematical Centre, Department of Computer Science Research Report IW 131, Amsterdam, 1980.

    Google Scholar 

  5. —, On the adequacy of finite equational methods for data type specification, ACM-SIGPLAN Notices 14 (11) (1979) 13–18.

    Google Scholar 

  6. GOGUEN, J.A., J.W. THATCHER & E.G. WAGNER, An initial algebra approach to the specification, correctness and implementation of abstract data types, in R.T. YEH (ed.) Current trends in programming methodology IV, Data structuring, Prentice-Hall, Engelwood Cliffs, New Jersey, 1978, 80–149.

    Google Scholar 

  7. KAMIN, S., Some definitions for algebraic data type specifications, SIGPLAN Notices 14 (3) (1979) 28–37.

    Google Scholar 

  8. MACHTEY, M. & P. YOUNG, An introduction to the general theory of algorithms, North-Holland, New York, 1978.

    Google Scholar 

  9. MAL'CEV, A.I., Constructive algebras, I., Russian Mathematical Surveys, 16 (1961) 77–129.

    Google Scholar 

  10. RABIN, M.O., Computable algebra, general theory and the theory of computable fields, Transactions American Mathematical Society, 95 (1960) 341–360.

    Google Scholar 

  11. ROSEN, B.K., Tree manipulating systems and Church-Rosser theorems, J. Association Computing Machinery, 20 (1973) 160–187.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leiden, Wassenaarseweg 80, 2300 RA, LEIDEN, The Netherlands

    J. A. Bergstra

  2. Department of Computer Science, Mathematical Centre, 2e Boerhaavestraat 49, 1091 AL, AMSTERDAM, The Netherlands

    J. V. Tucker

Authors
  1. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. V. Tucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Tucker, J.V. (1980). A characterisation of computable data types by means of a finite equational specification method. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation