Models and equality for logical programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 250 LNCS, Issue , 1987, Pages 1-22

  Goguen, Joseph A ^a,b   Meseguer, José ^a,b  

^a SRI INTERNATIONAL   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; SEMANTICS; SOFTWARE DESIGN;

COMPLETENESS THEOREMS; CONSTRAINT LANGUAGE; EQUALITY RELATIONS; LOGICAL PROGRAMMING; LOGICAL VARIABLES; SEMANTIC FOUNDATION; STANDARD INTERPRETATION; STANDARD TOOLS;

COMPUTER CIRCUITS;

EID: 85034963820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014969     Document Type: Conference Paper

References (27)

1. Michael A. Arbib and Ernest Manes. Arrows, Structures and Functors. Academic Press, 1975.
2. John Backus. “Can Programming be Liberated from the von Neumann Style?”. Communications of the Association for Computing Machinery 21, 8 (1978), 613-641.
3. Jon Barwise. “Axioms for Abstract Model Theory”. Annals of Mathematical Logic 7 (1974), 221-265.
4. Robert Boyer and Moore, J. A Computational Logic. Academic Press, 1980.
5. Rod Burstall and Joseph Goguen. “Putting Theories together to Make Specifications”. Proceedings, Fifth International Joint Conference on Artificial Intelligence 5 (1977), 1045-1058.
6. Rod Burstall and Joseph Goguen. Lecture Notes in Computer Science. Volume 86: The Semantics of Clear, a Specification Language. In Proceedings of the 1979 Copenhagen Winter School on Abstract Software Specification, Springer-Verlag, 1980, pp. 292-332.
7. Rod Burstall and Joseph Goguen. Algebras, Theories and Freeness: An Introduction for Computer Scientists. In Proceedings, 1981 Marktoberdorf NATO Summer School, Reidel, 1982.
8. Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, 1985.
9. Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud and José Meseguer. Principles of OBJ2. In Proceedings, Symposium on Principles of Programming Languages, Association for Computing Machinery, 1985, pp. 52-66.
10. Joseph Goguen and Rod Burstall. Institutions: Abstract Model Theory for Computer Science. CSLI-85-30, Center for the Study of Language and Information, Stanford University, 1985. Also submitted for publication; a preliminary version appears in Proceedings, Logics of Programming Workshop, edited by Edward Clarke and Dexter Kozen, Volume 164, Springer-Verlag Lecture Notes in Computer Science, pages 221-256, 1984.
11. Joseph Goguen and José Meseguer. Eqlog: Equality, Types, and Generic Modules for Logic Programming. In Functional and Logic Programming, Douglas DeGroot and Gary Lindstrom, Eds., Prentice-Hall, 1986, pp. 295-363. An earlier version appears in Journal of Logic Programming, Volume 1, Number 2, pages 179-210, September 1984.
12. Joseph Goguen and José Meseguer. Extensions and Foundations for Object-Oriented Programming. In preparation for Research Directions in Object-Oriented Programming, edited by Bruce Shriver and Peter Wegner. Preliminary version in SIGPLAN Notices, Volume 21, Number 10, pages 153-162, October 1986.
13. Joseph Goguen and José Meseguer. “Remarks on Remarks on Many-Sorted Equational Logic”. Bulletin of the European Association for Theoretical Computer Science 30 (October 1986), 66-73. Also to appear in SIGPLAN Notices.
14. Joseph Goguen and José Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance. To appear, SRI International, Computer Science Lab, 1987. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983.
15. Joseph Goguen and José Meseguer. Order-Sorted Algebra Solves the Constructor-Selector Problem. In preparation.
16. Joseph Goguen, Jean-Pierre Jouannaud and José Meseguer. Operational Semantics of Order-Sorted Algebra. In Proceedings, 1985 International Conference on Automata, Languages and Programming, Springer-Verlag, 1985. Summary presented at IFIP WG2.2 (Boston MA) June 1984.
17. Joseph Goguen, James Thatcher and Eric Wagner. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. RC 6487, IBM T. J. Watson Research Center, October, 1976. Appears in Current Trends in Programming Methodology, IV, edited by Raymond Yeh, Prentice-Hall, 1978, pages 80-149.
18. Joseph Y. Halpern, John H. Williams, Edward L. Wimmers and Timothy Winkler. Denotational Semantics and Rewrite Rules for FP. In Proceedings, Symposium on Principles of Programming Languages, Association for Computing Machinery, 1985, pp. 108-120.
19. Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. Monash University, Australia, 1986. Draft.
20. Joxan Jaffar and Spiro Michaylov. Methodology and Implementation of a Constraint Logic Programming System. Monash University, Australia, 1986. Draft.
21. Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.
22. José Meseguer and Joseph Goguen. Initiality, Induction and Computability. In Algebraic Methods in Semantics, Maurice Nivat and John C. Reynolds, Eds., Cambridge University Press, 1985, pp. 459-541. Also SRI CSL Technical Report 140, December 1983.
23. José Meseguer, Joseph Goguen and Gert Smolka. Order-Sorted Unification. SRI International, 1987. In preparation.
24. Michael O’Donnell. Equational Logic as a Programming Language. MIT Press, 1985.
25. J. Alan Robinson. “A Machine-oriented Logic Based on the Resolution Principle”. Journal of the Association for Computing Machinery 12 (1965).
26. Gert Smolka, Joseph Goguen and José Meseguer. Order-Sorted Equational Computation. SRI International, 1987. In preparation.
27. C. Walther. Unification in Many-sorted Theories. In Advances in Artificial Intelligence — Proceedings, Sixth European Conference on Artificial Intelligence, North-Holland, 1984, pp.