References

• 1. 1)
     • Goguen, J.A., Meseguer, J.: `Order-sorted algebra I: partial and overloaded operators, errors and inheritance', Technical Report, 1987.
  2. 2)
     • Goguen, J.A., Winkler, T.: `Introducing OBJ3', SRI-CSL-88-9, Technical Report, August 1988, (to appear in Case Studies in Algebraic Specification Using OBJ).
  3. 3)
     • Huet, G., Oppen, D.C.: `Equations and rewrite rules: a survey', CSL-111, Technical Report, 1980, (see also BOOK, R.: 'Formal language: perspectives and open problems', Academic Press, 1980, pp. 349–405).
  4. 4)
     • Nakagawa, AT., Futatsugi, K.: `Software process a la algebra: OBJ for OBJ', Proc. 12th IEEE, ICSE, 1990, p. 12–23.
  5. 5)
     • F.L. Bauer , M. Wirsing . Crypt-equivalent algebraic specifications. Ada. Inform. , 111 - 153
  6. 6)
     • H.-D. Ehrich . On the theory of specification, implementation, and parameterization of abstract data types. J. ACM , 206 - 227
  7. 7)
     • Saw Ada, T., Futatsugi, K.: `Incremental development environment for algebraic specifications', Japanese Software Symposium '90, (in English).
  8. 8)
     • Goguen, J., Meseguer, J.: `Unifying functional, object-oriented and relational programming with logical semantics', SRI-CSL-87-7, Technical Report, July 1986.
  9. 9)
     • Ehrich, H.-D.: `Extensions and implementations of abstract data type specifications', Proc. 7th Symp. on Mathematical Foundations of Computer Science, 1978, Led. Notes Comput. Sri., 64, p. 155–164.
  10. 10)
      • Futatsugi, K.: `Experiences in algebraic specification/programming language systems', Internal Report, 1989.
  11. 11)
      • Futatsugi, K., Goguen, J., Jouannaud, J.-R., Meseguer, J.: `Principles of OBJ2', Proc. 12th ACM POPL, 1985, p. 52–66.
  12. 12)
      • Kirchner, C., Kirchner, H., Meseguer, J.: `Operational semantics of OBJ3', 87-R-87, Technical Report, 1987, (see also Proc. ICALP '88, Tampere, July 1988, Springer-Verlag).
  13. 13)
      • D. Sannella , A. Tarlecki . Toward formal development of programs from algebraic specifications: implementations revisited. Ada. Informa. , 3 , 233 - 281
  14. 14)
      • Nakagawa, AT., Futatsugi, K.: `Stepwise refinement process with modularity: an algebraic approach', Proc. 11th IEEE ICSE, 1989, p. 166–177.
  15. 15)
      • Choppy, C., Kaplan, S.: `Mixing abstract and concrete modules: specification, development and prototyping', Proc. 12th IEEE ICSE, 1990, p. 173–184.
  16. 16)
      • Ehrig, H., Kreowski, H.J., Padawitz, P.: `Algebraic implementation of abstract data types: concept, syntax, semantics and correctness', Proc. ICALP '80, 1980, Led. Notes Comput. Sci, 85, p. 142–156.
  17. 17)
      • J.V. Guttag . The algebraic specification of abstract data types. Ada. Inform. , 1 , 27 - 52
  18. 18)
      • J. Meseguer , J.A. Goguen . (1984) Initiality, induction and computability, Algebraic methods in semantics.