Towards an algebraic semantics for the object paradigm

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

Volumn 785 LNCS, Issue , 1994, Pages 1-29

  Goguen, Joseph A ^a   Diaconescu, Răzvan ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ELECTRIC CONNECTORS; MACHINERY; SEMANTICS; SPECIFICATIONS;

ALGEBRAIC SEMANTIC; CONCURRENT SYSTEMS; EQUATIONAL REASONING; EQUATIONAL SPECIFICATIONS; HIDDEN SORTED ALGEBRAS; LOGICAL VARIABLES; PARALLEL CONNECTIONS; UNIQUE IDENTIFIERS;

ABSTRACT DATA TYPES;

EID: 84969364034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57867-6_1     Document Type: Conference Paper

References (37)

1. Antonio Alencar. OOZE: An Object Oriented Spcification Language. PhD thesis, Programming Research Group, Oxford University Computing Lab, to appear 1994.
2. Antonio Alencar and Joseph Goguen. Specification in OOZE with examples. In Object Oriented Specification Case Studies, pages 158-183. Prentice Hall, 1993. Programming Research Group, Oxford University Computing Lab, Report PRG-TR-7-92, 1992.
3. Michael Barr and Charles Wells. Category Theory for Computing Science. Prentice-Hall, 1990.
4. Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31: 433-454, 1935.
5. Rod Burstall and Razvan Diaconescu. Hiding and beha.viour: an institutional approach. Technical Report ECS-LFCS-8892-253, Laboratory for Foundations of Computer Science, University of Edinburgh, 1992. To appear in A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice Hall, 1993.
6. Rod Burstall and Joseph Goguen. The semantics of Clear, a specification language. In Dines Bjorner, editor, Proceedings, 1979 Copenhagen Winter School on Abstract Software Specificotion, pages 292-332. Springer, 1980. Lecture Notes in Computer Science, Volume 86; based on unpublished notes handed out at the Symposium on Algebra and Applications, Stefan Banach Center, Warsaw, Poland, 1978.
7. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewriting systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, pages 244-320. Elsevier Science, 1990.
8. Razvan Diaconescu. The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1993. Written in 1990.
9. Razvan Diaconescu, Joseph Goguen, and Petros Stefaneas. Logical support for modularisation. In Gerard Huet and Gordon Plotkin, editors, Logical Environments, pages 83-130. Cambridge, 1993. Proceedings of a Workshop held in Edinburgh, Scotland, May 1991.
10. Joseph Goguen. Principles of parameterized programnfing. In Ted Biggerstaff and Alan Perlis, editors, Software Reusability, Volume I: Concepts and Models, pages 159-225. Addison Wesley, 1989.
11. Joseph Goguen. An algebraic approach to refinement. In Dines Bjorner, C.A.R. Hoare, and Hans Langmaack, editors, Proceedings, VDM'90: VDM and Z-Formal Methods in Software Development, pages 12-28. Springer, 1990. Lecture Notes in Computer Science, Volume 428.
12. Joseph Goguen. Hyper programming: A formal approach to software environments. In Proceedings, Symposium on Formal Approuches to Software Environment Technology. Joint System Development Corporation, Tokyo, Japan, January 1990.
13. Joseph Goguen. Proving and rewriting. In Helene Kirchner and Wolfgang Wechler, editors, Proceedings, Second International Conference on Algebraic and Logic Programming, pages 1-24. Springer, 1990. Lecture Notes in Computer Science, Volume 463.
14. Joseph Goguen. A categorical manifesto. Mathematical Structures in Computer Science, 1 (1): 49-67, March 1991. Also, Programming Research Group Technical Monograph PRG-72, Oxford University, March 1989.
15. Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.
16. Joseph Goguen. Theorem Proving and Algebra. MIT, 1994.
17. Joseph Goguen and Rod Burstall. Introducing institutions. In Edward Clarke a, nd Dexter Kozen, editors, Proceedings, Logics of Programming Workshop, pages 221-256. Springer, 1984. Lecture Notes in Computer Science Volume 164.
18. Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39 (1): 95-146, January 1992. Draft appears as Report ECS-LFCS-90-1O6, Computer Science Department, University of Edinburgh, January 1990; an early ancestor is “Introducing Institutions,” in Proceedings, Logics of Programming I. Vorkshop, Edward Clarke and Dexter Kozen, Eds., Springer Lecture Notes in Computer Science, Volume 164, pages 221-256, 1984.
19. Joseph Goguen and Tom Kemp. A hidden Herbrand theorem, 1993. Submitted to special issue of Theoretical Computer Science, edited by A. William Roscoe and Michael W. Mislove.
20. Joseph Goguen and José Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. In M. Nielsen and E.M. Schmidt, editors, Proceedings, 9th International Conference on Automata, Languages and Programming, pages 265-281. Springer, 1982. Lecture Notes in Computer Science, Volume 140.
21. Joseph Goguen and José Meseguer. Unifying functional, object-oriented and relational programming, with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417-477. MIT, 1987. Preliminary version in SIGPLAN Notices, Volume 21. Number 10, pages 153-162, October 1986.
22. Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105 (2): 217-273, 1992. Also, Programming Research Group Technical Monograph PRG-80, Oxford University, December 1989, and Technical Report SRI-CSL-89-10, SRI International Computer Science Lab, July 1989; originally given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983; many draft versions exist, from as early as 1985.
23. Joseph Goguen and Adolfo Socorro. Module composition and system design for the object paradigm. Journal of Object Oriented Programming, to appear 1994. Technical Report, Oxford University Computer Lab, 1993.
24. Joseph Goguen, Andrew Stevens, Keith Hobley, and Hendrik Hilberdink. 2OBJ, a. metalogical framework based on equational logic. Philosophical Transactions of the Royal Society, Series A, 339: 69-86, 1992. Also in Mechanized Reasoning and Hardware Design, edited by C.A.R. Hoa.re and M.J.C. Gordon, Prentice-Hall, 1992, pages 69-86.
25. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen, editor, Applications of Algebraic Specification using OBJ. Cambridge, to appear 1993. Also to appear as Technical Report from SRI International.
26. Joseph Goguen and David Wolfranl. On types and FOOPS. In Robert Meersman, William Kent, and Samit Khosla, editors, Object Oriented Databases: Analysis, Design and Construction, pages 1-22. North Holland, 1991. Proceedings, IFIP TC2 Conference, Windermere, UK, 2-6 July 1990.
27. Robert Goldblatt. Topoi, the Categorial Analysis of Logic. North-Holland, 1979.
28. F. William Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, U.S.A., 50: 869-872, 1963. Summaxy of Ph.D. Thesis, Columbia University.
29. Ernest Manes. Algebraic Theories. Springer, 1976. Graduate Texts in Mathematics, Volume 26.
30. José Meseguer and Joseph Goguen. Initiality, induction and computability. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics. pages 459-541. Cambridge, 1985.
31. David Parnas. Information distribution aspects of design methodology, Information Processing ‘72, 71: 339-344, 1972. Proceedings of 1972 IFIP Congress.
32. Horst Reichel. Behavioural equivalence-a unifying concept for initial and final specifications. In Proceedings, Third Hungarian Computer Science Conference. Akademiai Kiado, 1981. Budapest.
33. Horst Reichel. Behavioural validity of conditional equations in abstract data types. In Contributions to General Algebra 3. Teubner, 1985. Proceedings of the Vienna. Conference, June 21-24, 1984.
34. Donald Sannella and Andrzej Tarlecki. Specifications in an arbitrary institution, Information and Control, 76: 165-210, 1988. Eaxlier version in Proceedings, International Symposium on the Semantics of Data Types, Lecture Notes in Computer Science, Volume 173, Springer, 1984.
35. Adolfo Socorro. Design, Implementation, and Evaluation of a Declarative Object Oriented Language. PhD thesis, Programming Research Group, Oxford University, 1993.
36. Andrew Stevens and Joseph Goguen. Mechanised theorem proving with 2OBJ: A tutorial introduction. Technical report, Programming Research Group, University of Oxford, 1993.
37. Alfred Tarski. The semantic conception of truth. Philos. Phenomenological Research, 4: 13-47, 1944.