Equality, types, modules, and (why not?) generics for logic programming

Apt, 1982, Contributions to the Theory of Logic Programming, J. ACM, 29, 841, 10.1145/322326.322339 Bellia, 1982, The Call by Name Semantics of a Clause Language with Functions, 281 Bergstra, 1980, A Characterization of Computable Data Types by Means of a finite equational specification method, 76 Berry, G. and Currien, P. L., The Applicative Language CDS: its Denotational and Operational Semantics, In: (M. Nivat and J. Reynolds, eds.), Algebraic Methods in Semantics, Cambridge University Press, to appear. Burstall, 1977, Putting Theories together to Make Specifications, Proceedings, Fifth International Joint Conference on Artificial Intelligence, 5, 1045 Burstall, 1980, The Semantics of Clear, a Specification Language, 292 Burstall, 1982, Algebras, Theories and Freeness: An Introduction for Computer Scientists Byrd, 1980, A Guide to Version 3 of DEC-10 Prolog Clark, 1978, Negation as Failure, 292 Colmerauer, 1979, Etude et Realisation d'un Systeme Prolog Davis, 1976, Hilbert's Tenth Problem: Diophantine Equations: Positive Aspects of a Negative Solution, Mathematical Developments Arising from Hilbert Problems, Vol. 28, 323, 10.1090/pspum/028.2/0432534 Dershowitz, 1983, Computing with Rewrite Rules United States Department of Defense, Reference Manual for the Ada Programming Language, ANSI/MIL-STD-1815 A. Dömölki, 1983, Prolog in Practice, 627 Fages, F., Associative Commutative Unification, These de 3eme Cycle; to appear in Proceedings, 1984 Conference on Automatic Deduction. Fages, 1983, Unification and Matching in Equational Theories Fay, 1979, First-order Unification in an Equational Theory, Proceedings, Fourth Workshop on Automated Deduction, 4, 161 Goguen, 1974, Semantics of Computation, 234 Goguen, 1975, Semantics of Computation, Vol. 25, 151 Goguen, 1983, Parameterized Programming, Proceedings, Workshop on Reusability in Programming, 138 Goguen, 1984, Suggestions for Using and Organizing Libraries for Ada Program Development Goguen, 1984, Introducing Institutions, Vol. 164, 221 Goguen, 1981, Completeness of Many-sorted Equational Logic, SIGPLAN Notices, 16, 24, 10.1145/947864.947865 Goguen, 1982, Completeness of Many-sorted Equational Logic, SIGPLAN Notices, Vol. 17, 9, 10.1145/947886.947887 Goguen, 1983, Logic of Subsorts and Polymorphism Goguen, 1979, An Introduction to OBJ: A Language for Writing and Testing Software Specifications, Specification of Reliable Software, 170 Goguen, 1982, Programming with Parameterized Abtract Objects in OBJ, 163 Goguen, 1978, An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, 80 Goguen, 1977, Initial Algebra Semantics and Continuous Algebras, Association for Computing Machinery, 24 Hansson, 1982, Properties of a Logic Programming Language, 267 Herbrand, 1930, Recherches sour la Theorie de la Demonstration, Travaux de la Soc. des Sciences et des Lettres de Varsovie, Classe III, 33 Hoffman, 1982, Programming with Equations, ACM Transactions on Programming Languages and Systems, 1, 83, 10.1145/357153.357158 Hsiang, J., Refutational Theorem Proving using Term Rewriting Systems, Ph.D. Thesis, University of Illinois at Champaign-Urbana. Hullot, 1980, Canonical Forms and Unification, Vol. 87, 318 Jouannaud, 1983, Incremental Construction of Unification Algorithms in Equational Theories, 361 Kornfeld, 1983, Equality for Prolog., Proceedings, Seventh International Joint Conference on Artificial Intelligence, 7, 514 Kowalski, 1974, Logic for Problem Solving Liskov, 1979, CLU Reference Manual Matijasevic, 1971, Diophantine Representation of Recursively Enumerable Predicates, 171 McCarthy, 1980, Circumscription—A Form of Non-Monotonic Reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 Meseguer, 1983, Initially, Induction and Computability Plotkin, 1972, Building-in Equational Theories, Machine Intelligence, 7, 73 Remy, 1982, Etude des Systemes de Reecriture Conditionnels et Application aux Types Abstraits Algebriques Robinson, 1965, A Machine-oriented Logic Based on the Resolution Principle, J. Association for Computing Machinery, 12, 10.1145/321250.321253 Robinson, 1969, Paramodulation and First Order Theorem Proving with Equality, 135 Shapiro, 1984, Systems Programming in Concurrent Prolog, 93 Slagle, 1974, Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity, J. ACM, 21, 662, 10.1145/321850.321859 Stickel, 1984, A Prolog Technology Theorem Prover Subrahmanyam, 1984, Pattern Driven Lazy Reduction: a Unifying Evaluation Mechanism for Functional and Logic Programs, 228 van Emden, 1976, The Semantics of Predicate Logic as a Programming Language, J. Association for Computing Machinery, 23, 733, 10.1145/321978.321991 Warren, 1980, Logic Programming and Compiler Writing, Software—Practice and Experience, 10, 97, 10.1002/spe.4380100203