Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Birkhoff, 1935, On the structure of abstract algebras, Proc. Cambridge Philos. Soc., 31, 433, 10.1017/S0305004100013463

Bruce, 1988, A modest model of records, 38

Burstall, 1977, Putting theories together to make specifications, 1045

Burstall, 1980, The semantics of Clear, a specification language, Vol. 86, 292

Burstall, 1980, Hope: an experimental applicative language, 136

Cardelli, 1984, A semantics of multiple inheritance, Vol. 173, 51

Cardelli, 1988, Structural subtyping and the notion of power type, 70

Cardelli, 1985, On understanding types, data abstraction, and polymorphism, Computing Surveys, 17, 471, 10.1145/6041.6042

Clocksin, 1981

Colmerauer, 1979, Etude et réalisation d'un système Prolog

Cunningham, 1983, Rewrite systems on a lattice of types

Dahl, 1970, The SIMULA 67 common base language

Futatsugi, 1985, Principles of OBJ2, 52

Futatsugi, 1987, Parameterized programming OBJ2, 51

Gogolla, 1984, Partially ordered sorts in algebraic specifications, 139

1983

Goguen, 1977, Abstract errors for abstract data types, 21.1

1979, 491

Goguen, 1978, Order sorted algebra

Goguen, 1984, Parameterized programming, Trans. Software Engrg., SE-10, 528, 10.1109/TSE.1984.5010277

Goguen, 1986, One, none, a hundred thousand specification languages, 995

Goguen, 1989, Higher-order functions considered unnecessary for higher-order programming

Goguen, 1985, Institutions: abstract model theory for computer science

1984, Vol. 164, 221

Goguen, 1985, Operational semantics of order-sorted algebra, Vol. 194

Goguen, 1982, Universal realization, persistent interconnection and implementation of abstract modules, Vol. 140, 265

Goguen, 1985, Completeness of many-sorted equational logic, Houston J. Math., 11, 307

Goguen, 1981, SIG-PLAN Notices, 16, 24, 10.1145/947864.947865

Goguen, 1982, SRI Computer Science Lab Tech. Report CSL-135

Goguen, 1984, Programming in Prolog

Goguen, 1986, Eqlog: equality, types, and generic modules for logic programming, 295

Goguen, 1984, J. Logic Programming, 1, 179, 10.1016/0743-1066(84)90004-9

Goguen, 1986, Remarks on many-sorted equational logic, Bull. EATCS, 30, 66

Goguen, 1987, SIGPLAN Notices, 22, 41, 10.1145/24714.24719

Goguen, 1987, Unifying functional, object-oriented and relational programming, with logical semantics, 417

Goguen, 1986, SIGPLAN Notices, 21, 153, 10.1145/323648.323755

Goguen, 1987, Models and equality for logical programming, Vol. 250, 1

Goguen, 1987, Order-sorted algebra solves the constructor selector, multiple representation and coercion problems, 18

Goguen, 1987

Goguen, 1988, Software for the rewrite rule machine, 628

Goguen, 1983, Programming with parameterized abstract objects in OBJ, 163

Goguen, 1981, Algebraic denotational semantics using parameterized abstract modules, Vol. 107, 292

Goguen, 1979, An introduction to OBJ: a language for writing and testing software specification, 170

1985, 391

Goguen, 1976, An initial algebra approach to the specification, correctness and implementation of abstract data types

1978, 80

Goguen, 1988, Introducing OBJ3

Goldberg, 1983

Gratzer, 1979

Guiho, 1983, Multioperator algebras

Harper, 1986, Standard ML

Hartwig, 1984, An algebraic approach to the syntax and semantics of languages with subscripted variables, Period. Math. Hungar., 15, 61, 10.1007/BF02109372

Higgins, 1963, Algebras with a scheme of operators, Math. Nachr., 27, 115, 10.1002/mana.19630270108

Hoare, 1969, An axiomatic basis for computer programming, Comm. ACM, 12, 576, 10.1145/363235.363259

Hudak, 1988

Janssen, 1983, Foundations and applications of Montague grammar

Jones, 1987

Kamin, 1984, Partial implementations of abstract data types: a dissenting view on errors, Vol. 173, 317

Kirchner, 1988, Operational semantics of OBJ3, Vol. 241, 287

Kowalski, 1974, Logic for problem solving

Leinwand, 1988, Cell and ensemble architecture of the rewrite rule machine, 869

Lloyd, 1984

Mac Lane, 1971

Meseguer, 1983, Order completion monads, Algebra Universalis, 16, 63, 10.1007/BF01191754

Meseguer, 1989, General logics, 257

Meseguer, 1989, Relating models of polymorphism, 228

Meseguer, 1988

Meseguer, 1985, Deduction with many-soted rewrite rules

Meseguer, 1985, Initiality, induction and computability, 459

Milner, 1978, A theory of type polymorphism in programming, J. Comput. System Sci., 17, 348, 10.1016/0022-0000(78)90014-4

Montague, 1974

Mosses, 1985, A basic semantic algebra, Vol. 173, 87

Mosses, 1989, Unified algebras and institutions

O'Donnell, 1985

O'Keefe, 1985, Source level tools for logic programming, 68

Parsaye-Ghomi, 1982, Higher order data types

Plaisted, 1982, An initial algebra semantics for error presentations

Poigné, 1983, On semantic algebras: higher order structures

Poigné, 1987, Parameterization for order-sorted algebraic specification

1983

Reynolds, 1974, Towards a theory of type structure, Vol. 19, 408

Reynolds, 1980, Using category theory to design implicit conversions and generic operators, Vol. 94, 211

Scott, 1971, Towards a mathematical semantics for computer languages, 19

Smolka, 1986, Order-sorted horn logic: semantics and deduction

Smolka, 1991, Order-sorted equational computation, 299

Smolka, 1987, Proc. Coll. on the Resolution of Equations in Algebraic Structures

Smolka, 1987

Sterling, 1986

Stoy, 1977

Strachey, 1967, Fundamental concepts in programming languages, Lecture Notes from International Summer School in Computer Programming, Copenhagen

Touretzky, 1984, The mathematics of inheritance systems

Turner, 1985, a non-strict functional language with polymorphic types, Vol. 201, 1

Wadge, 1982, Classified algebras

Walther, 1983, A many-sorted calculus based on resolution and paramodulation, 882

Walther, 1986, A classification of many-sorted unification theories, Vol. 230, 525