Error Handling for Parameterized Data Types

  • Axel Poigné
Conference paper
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 116)

Abstract

The merit and the problems of the initial algebra approach to data type specification are widely discussed (e.g. [ADJ 78], [EKTWW84] , [EKMP 82], [Or 82]), a prevailing view being that the foundations are settled enough to define specification languages based on this approach [EFH 83]. We somewhat disagree with this view, not so much as we favour other approaches [SW 83], [BG 80], [M.V 83] — in fact we believe that the initial algebra approach has the advantage clearly to distinguish between syntactical constructions and correctness criteria on the semantical level — but for reasons being inherent in the method.

Keywords

Sugar Univer Hate 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ADJ 78]
    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, IV: Data Structuring (Prentice-Hall, Englewood Cliffs,NJ) 1978Google Scholar
  2. [BG 80]
    R.M. Burstall, J.A. Goguen, Semantics of CLEAR, a specification language, Proc. 1979 Copenhagen Winter School on Abstract Software Specification, Lecture Notes in Computer Science 86, 1980Google Scholar
  3. [EFH 83]
    H. Ehrig, W. Fey, H. Hansen, ACT ONE: An Algebraic Specification Language with two Levels of Semantics, Techn. Rep. No. 83-03, Dept. of Computer Science, Techn. University Berlin, 1983Google Scholar
  4. [EKMP—82]
    H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz, Algebraic Implementation of Abstract Data Types, TCS 20, 1982Google Scholar
  5. [EKTWW 84]
    H. Ehrig, H.-J. Kreowski, J.W. Thatcher, E.G. Wagner J.B. Wright, Parameter Passing in Algebraic Specification Languages, TCS , 1984, also Proc. of the Aarhus Workshop on Program Specification, LNCS 134, 1982Google Scholar
  6. [GM 81]
    J.A. Goguen, J. Meseguer, Completeness of many-sorted equational logic, ACM SIGPLAN Notices 16.7, 1981Google Scholar
  7. [Gogolla 83]
    M. Gogolla: Algebraic Specifications with Partially Ordered Sorts and Declarations, Techn. Rep. 169, Abt. Informatik, Univ. Dortmund, 1983Google Scholar
  8. [Goguen 78]
    J.A. Goguen, Order sorted algebras: Exception handling and error sorts, coercions and overloaded operators, Semantics and Theory of Computation Report No. 14, UCLA, 1978Google Scholar
  9. [Guttag 76]
    J.V. Guttag, Abstract data -types and the development of data structures, Proc, Conf. on Data Abstraction, Definition, and Structure, SIGPLAN Notices, Vol. 8, 1976Google Scholar
  10. [MV 83]
    T.S.E. Maibaum, P.A.S. Veloso, A logical approach to abstract data types, Techn. Rep. Dept. of Computing, Imperial College London, 1983Google Scholar
  11. [Or 82]
    F. Orejas, Characterizing composability of abstract implementations, Rep. RR 82/08, Univ. Barcelona, 1982Google Scholar
  12. [Poigné 84]
    A. Poigné, Another look at parameterization using algebraic specifications with subsorts, Proc. MFCS’84, LNCS 176, 1984Google Scholar
  13. [Poigné 85]
    A. Poigné, Modularization techniques for algebraic specifications with subsorts, revised version, in preparationGoogle Scholar
  14. [Schneider 84]
    M. Schneider, Zur Beziehung syntaktischer und semantischer Konstruktionen auf Datentypen, Diplomarbeit, Abt. Informatik, Univ. Dortmund, 1984Google Scholar
  15. [SW 83]
    D.T. Sannella, M. Wirsing, A kernel language for algebraic specification and implementation, Proc. Int. Conf. of Foundations of Computation Theory, LNCS 158, 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Axel Poigné
    • 1
  1. 1.Dept. of ComputingImperial CollegeLondonUK

Personalised recommendations