Advertisement

Algebraic specifications for parametrized data types with minimal parameter and target algebras

  • J. A. Bergstra
  • J. W. Klop
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

We conceive a parametrized data type as a partial functor ϕ: ALG (σ) → ALG (δ), where δ is a signature extending σ and ALG (σ) is the class of minimal σ-algebras which serve as parameters.

We focus attention on one particular method of algebraically specifying parametrized data types: finite specifications with conditional equations using auxiliary sorts and functions provided with initial algebra semantics.

We introduce the concept of an effective parametrized data type. A satisfactory adequacy result is then obtained: each effective parametrized data type possesses a finite algebraic specification under initial semantics.

Keywords

Abstract Data Type Conditional Equation Algebraic Specification Initial Algebra Springer LNCS 
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.W. KLOP, Algebraic specifications for parametrized data types with minimal parameter and target algebras, Mathematical. Centre, Department of Computer Science Research Report IW 183, Amsterdam 1981.Google Scholar
  2. [2]
    BERGSTRA, J.A. & J.W. KLOP, Initial algebra specifications for parametrized data types, Mathematical Centre, Department of Computer Science Research Report IW 186, Amsterdam 1981.Google Scholar
  3. [3]
    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
  4. [4]
    BERGSTRA, J.A. & J.V. TUCKER, A characterization of computable data types by means of a finite equational specification method, Proc. 7th ICALP, Springer LNCS Vol. 85, 1980.Google Scholar
  5. [5]
    BERGSTRA, J.A. & J.V. TUCKER, Initial and final algebra semantics for data type specifications: two characterization theorems, Mathematical Centre, Department of Computer Science Research Report IW 131, Amsterdam 1980.Google Scholar
  6. [6]
    BURSTALL, R.M. & J.A. GOGUEN, An informal introduction to specifications using CLEAR, Lecture notes for the International Summer School on theoretical foundations of programming methodology, Munich 1981.Google Scholar
  7. [7]
    EHRICH, H.D., On the theory of specification, implementation and parametrization of abstract data types. Research Report Dortmund 1978.Google Scholar
  8. [8]
    EHRIG, H.E., H.-J. KREOWSKI, J.W. THATCHER, E.G. WAGNER & J.B. WRIGHT, Parameterized data types in algebraic specification languages, Proc. 7th ICALP, Springer LNCS Vol. 85, 1980.Google Scholar
  9. [9]
    EHRIG, H., Algebraic theory of parameterized specifications with requirements, in Proc. of CAAP81, Springer LNCS, Vol. 112.Google Scholar
  10. [10]
    GANZINGER, H., Parameterized specifications: parameter passing and optimizing implementation. Report TUM-18110. Technische UniversitÄt München, August 1981.Google Scholar
  11. [11]
    KAPHENGST, H. & H. REICHEL, Algebraische Algorithmentheorie, VEB Robotron, Dresden WIB, 1971.Google Scholar
  12. [12]
    LEHMANN, D.J. & M.B. SMYTH, Data types, Proc. 18th IEEE Symposium on Foundations of Computing, Providence R.I. November 1977.Google Scholar
  13. [13]
    Rogers jr., H., Theory of recursive functions and effective computability, McGraw-Hill, 1967.Google Scholar
  14. [14]
    Scott, D.S., Lambda calculus and recursion theory, in Proc. Third Scandinavian Logic Conf., Ed. S. Kanger, North Holland Studies in Logic and the Foundations of Mathematics, Vol. 82, 1975.Google Scholar
  15. [15]
    Thatcher, J.W., E.G. Wagner & J.B. Wright, Data type specification: parameterization and the power of specification techniques, Proc. SIGACT 10th Annual Symp. on Theory of Computing, pp. 119–132, May 1978.Google Scholar
  16. [16]
    Wirsing, M., An analysis of semantic models for algebraic specifications, Lecture Notes for the International Summer School on theoretical foundations of programming methodology, Munich 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. W. Klop
    • 2
  1. 1.Department of Computer ScienceUniversity of LeidenRA LeidenThe Netherlands
  2. 2.Department of Computer ScienceMathematical CentreSJ AmsterdamThe Netherlands

Personalised recommendations