Advertisement

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

  • J. A. Bergstra
  • J. V. Tucker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Keywords

Normal Form Function Symbol Replacement System Reduction Sequence Computable Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [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. [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. [5]
    —, On the adequacy of finite equational methods for data type specification, ACM-SIGPLAN Notices 14 (11) (1979) 13–18.Google Scholar
  6. [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. [7]
    KAMIN, S., Some definitions for algebraic data type specifications, SIGPLAN Notices 14 (3) (1979) 28–37.Google Scholar
  8. [8]
    MACHTEY, M. & P. YOUNG, An introduction to the general theory of algorithms, North-Holland, New York, 1978.Google Scholar
  9. [9]
    MAL'CEV, A.I., Constructive algebras, I., Russian Mathematical Surveys, 16 (1961) 77–129.Google Scholar
  10. [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. [11]
    ROSEN, B.K., Tree manipulating systems and Church-Rosser theorems, J. Association Computing Machinery, 20 (1973) 160–187.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. V. Tucker
    • 2
  1. 1.Department of Computer ScienceUniversity of LeidenLEIDENThe Netherlands
  2. 2.Department of Computer ScienceMathematical CentreAMSTERDAMThe Netherlands

Personalised recommendations