Fundamentals of Algebraic Specification 1: Equations and Initial Semantics (H. Ehrig and B. Mahr)
Joseph A. Goguen, José Meseguer · SIAM Review · 1987
Previous article Next article Fundamentals of Algebraic Specification 1: Equations and Initial Semantics (H. Ehrig and B. Mahr)J. A. Goguen and J. MeseguerJ. A. Goguen and J. Meseguerhttps://doi.org/10.1137/1029061PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] R. Burstall and , J. Goguen, Putting theories together to make specifications, Proc. Fifth International Joint Conference on Artificial Intelligence, Vol. 5, 1977, 1045–1058 Google Scholar[2] R. Burstall and , J. Goguen, The Semantics of Clear, a Specification Language, Proc. 1979 Copenhagen Winter School on Abstract Software Specification, Lecture Notes in Computer Science, Vol. 86, Springer-Verlag, Berlin, New York, 1980, 292–332 Google Scholar[3] K. Futatsugi, , J. Goguen, , J.-P. Jouannaud and , J. Meseguer, Principles of OBJ2, Proc. Symposium on Principles of Programming Languages, Association for Computing Machinery, New York, 1985, 52–66 Google Scholar[4] J. A. Goguen, Semantics of computationCategory theory applied to computation and control (Proc. First Internat. Sympos., San Francisco, Calif., 1974), Springer, Berlin, 1975, 151–163. Lecture Notes in Comput. Sci., Vol. 25, Univ. of Massachusetts at Amherst, 1974, pp. 234–249 52:4689 CrossrefGoogle Scholar[5] J. Goguen and , J. Meseguer, Completeness of many-sorted equational logic, Houston J. Math., 11 (1985), 307–334, (Preliminary versions have appeared in SIGPLAN Notices, 16 (1981), pp. 24–37, and 17 (1982), pp. 9–17; SRI Technical Report CSL-135, May 1982; and Technical Report CSLI-84-15, Center for the Study of Language and Information, Stanford Univ., September 1984.) 87i:03055 0602.08004 ISIGoogle Scholar[6] J. Goguen and , J. Meseguer, Order-sorted algebra I: Partial and overloaded operations, errors and inheritance, SRI International, Computer Science Lab, 1986, to appear. (Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983.) Google Scholar[7] J. Goguen, , J.-P. Jouannaud and , J. Meseguer, Operational semantics for order-sorted algebraAutomata, languages and programming (Nafplion, 1985), Lecture Notes in Comput. Sci., Vol. 194, Springer, Berlin, 1985, 221–231, New York, Summary presented at IFIP WG2.2, Boston, MA, June 1984 87h:68108 0591.68041 CrossrefGoogle Scholar[8] J. Goguen, , J. Thatcher and , E. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract data types, RC 6487, IBM T. J. Watson Research Center, 1976, October, reprinted in Current Trends in Programming Methodology, IV, Raymond Yeh, ed., Prentice-Hall, Englewood Cliffs, N.J., 1978, pp. 80–149 Google Scholar[9] J. Goguen, , J. Thatcher, , E. Wagner and , J. Wright, Abstract data types as initial algebras and the correctness of data representationsComputer Graphics, Pattern Recognition and Data Structure, IEEE Press, New York, 1975, 89–93 Google Scholar[10] J. Goguen, , J. Thatcher, , E. Wagner and , J. Wright, Initial algebra semantics and continuous algebras, J. Assoc. Comput. Mach., 24 (1977), 68–95 10.1145/321992.321997 58:25071 0359.68018 CrossrefISIGoogle Scholar[11] J. Guttag, Ph.D. Thesis, The specification and application to programming of abstract data types, Univ. of Toronto, 1975, Computer Science Department, Report CSRG-59 Google Scholar[12] G. Huet and , D. Oppen, Ronald Book, Equations and rewrite rules: A surveyFormal Language Theory: Perspectives and Open Problems, Academic Press, New York, 1980 CrossrefGoogle Scholar[13] J. Loeckx and , B. Mahr, A note on the equational calculus for many-sorted algebras with possibly empty carrier sets, A 58/01, Fachbereich Informatik, Universitat des Saarlandes, 1985 Google Scholar[14] J. Meseguer and , J. Goguen, Maurice Nivat and , John C. Reynolds, Initiality, induction, and computabilityAlgebraic methods in semantics (Fontainebleau, 1982), Cambridge Univ. Press, Cambridge, 1985, 459–541, Chapter 14; SRI CSL Technical Report 140, December 1983 88a:68073 0571.68004 Google Scholar[15] Horst Reichel, Structural induction on partial algebras, Mathematical Research, Vol. 18, Akademie-Verlag, Berlin, 1984, 205– 87m:08007b 0553.08002 Google Scholar[16] S. Zilles, Abstract specification of data types, Report, 119, Computation Structures Group, Massachussetts Inst. of Technology, 1974 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Volume 29, Issue 2| 1987SIAM Review History Published online:18 July 2006 InformationCopyright © 1987 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1029061Article page range:pp. 318-322ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics