This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
J. Goguen and R. Burstall (1985) Institutions: Abstract Model Theory for Specification and Programming. Journal of the Association for Computing Machinery 39 (1) 95–146. (Draft appears as Report ECS-LFCS-90–106, Computer Science Department, University of Edinburgh, January 1990. An early ancestor is ‘Introducing Institutions’ in: Clarke, E. and Kozen, D. (eds.) (1984) Proceedings, Logics of Programming Workshop, Springer-Verlag Lecture Notes in Computer Science 164 221–256.)
J. Goguen , J.-P. Jouannaud and J. Meseguer (1985) Operational Semantics of Order-Sorted Algebra. In: W. Brauer (ed.) Proceedings, 1985 International Conference on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 194.
J. Goguen and J. Meseguer (1982) Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. In: M. Nielsen and E. M. Schmidt (eds.) Proceedings, 9th International Conference on Automata, Languages and Programming, Aarhus, Denmark. Springer-Verlag Lecture Notes in Computer Science 140 265–281.
J. Goguen and J. Meseguer (1987a) Models and Equality for Logical Programming. In: H. Ehrig , G. Levi , R. Kowalski and U. Montanari (eds.) Proceedings, 1987 TAPSOFT, Pisa, Italy. Springer- Verlag Lecture Notes in Computer Science 250 1–22. (Also, Report CSLI-87–91 (1987) Center for the Study of Language and Information, Stanford University; reprinted in Mathematical Logic in Programming, Mir (Moscow) (1991) 274–310 (in Russian).)
J. Goguen and J. Meseguer (1992) Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. Theoretical Computer Science 105 (2) 217–273. (Also: Programming Research Group Technical Monograph PRG-80 (1989) Oxford University, and Technical Report SRI-CSL-89–10 (1989) SRI International, Computer Science Lab; originally given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983; many draft versions exist, from as early as 1985.)
J. Goguen , A. Stevens , K. Hobley and H. Hilberdink (1992) 2OBJ, a Metalogical Framework based on Equational Logic. Philosophical Transactions of the Royal Society Series A 339 69–86. (Also in Hoare, C. A. R. and Gordon, M. J. C. (eds.) (1992) Mechanized Reasoning and Hardware Design, Prentice-Hall, 69–86.)
J. Goguen , J. Thatcher , E. Wagner and J. Wright (1977) Initial Algebra Semantics and Continuous Algebras. Journal of the Association for Computing Machinery 24 (1) 68–95. An early version is ‘Initial Algebra Semantics’, Technical Report RC 4865 (1974), IBM T. J. Watson Research Center.)
P. J. Higgins (1963) Algebras with a Scheme of Operators. Mathematische Nachrichten 27 115–132.
F. W. Lawvere (1963) Functorial Semantics of Algebraic Theories. Proceedings, National Academy of Sciences, U.S.A. 50 869–872. (Summary of Ph.D. Thesis, Columbia University.)
P. Mosses (1989a) Unified Algebras and Action Semantics. Proceedings, Symposium on Theoretical Aspects of Computer Science. Springer-Verlag Lecture Notes in Computer Science 349.
A. Poigné (1984) Another Look at Parametrization using Algerbaic Specifications with Subsorts. Proceedings, Mathematical Foundations of Computer Science ‘84. Springer-Verlag Lecture Notes in Computer Science 176.
U. Waldmann (1992) Semantics of order-sorted specifications. Theoretical Computer Science 94 (1) 1–35.
C. Walther (1985) A Mechanical Solution of Schubert's Steamroller by Many-sorted Resolution. Artificial Intelligence 26 (2) 217–214.