A hidden agenda

Theoretical Computer Science

Volumn 245, Issue 1, 2000, Pages 55-101

  Goguen, Joseph ^a   Malcolm, Grant ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Algebraic specification; Coinduction; Concurrency; Correctness proofs; Object orientation

Indexed keywords

EID: 0002583222     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00275-3     Document Type: Article

References (108)

1. S. Abramsky, Interaction categories and communicating sequential processes, in: A.W. Roscoe (Ed.), A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice-Hall, Englewood Cliffs, NJ, 1994, pp. 1-15.
2. P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt et al. (Eds.), Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 389, Springer, Berlin, 1989.
3. P. America, J. de Bakker, J. Kok, J. Rutten, Denotational semantics of a parallel object-oriented language, Inform, and Comput. 83 (2) (1990) 152-205.
4. J. Baeten, W.P. Weijland, Process Algebra, Cambridge, 1990, Cambridge Tracts in Theoretical Computer Science, Vol. 18.
5. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (1993) 299-315.
6. M. Bidoit, R. Hennicker, M. Wirsing, Behavioural and abstractor specifications, Sci. Comput. Programming 25 (2-3) (1995) 149-186.
7. G. Birkhoff, On the structure of abstract algebras Proc. Cambridge Philos. Soc. (31) 1935.
8. B. Boehm, Software Engineering Economics, Prentice-Hall, Englewood cliffs, NJ, 1981.
9. R. Burstall, Programming with modules as typed functional programming, Proc. Internat. Conf. on Fifth Generation Computing Systems, 1985.
10. R. Burstall, R. Diaconescu, Hiding and behaviour: an institutional approach, in: A.W. Roscoe (Ed.), A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice Hall, Englewood Cliffs, NJ, 1994, pp. 75-92.
11. R. Burstall, J. Goguen, Putting theories together to make specifications, in: R. Reddy (Ed.), Proc. Internat. Joint Conf. on Artificial Intelligence, 5th Department of Computer Science, Carnegie-Mellon University, 1977, pp. 1045-1058.
12. G. Button W. Sharrock, Occasioned practises in the work of implementing development methodlogies, in: M. Jirotka, J. Goguen (Eds.), Requirements Engineering: Social and Technical Issues, Academic Press, New York, 1994, pp. 217-240.
13. C. Cîrstea, A semantic study of the object paradigm, Transfer Thesis, Programming Research Group, Oxford University, 1996.
14. C. Cîrstea, Coalgebra semantics for hidden algebra: parameterized objects and inheritance, Paper presented at the 12th Workshop on Algebraic Development Techniques, June 1997.
15. R. Diaconescu, The logic of Horn clauses is equational, Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1993, Written in 1990.
16. R. Diaconescu, Category-based Semantics for Equational and Constraint Logic Programming, Ph.D. Thesis, Programming Research Group, Oxford University, 1994.
17. R. Diaconescu, A category-based equational logic semantics to constraint programming, in: M. Haveraaen, O. Owe, O.J. Dahl (Eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 200-222
18. R. Diaconescu, Foundations of behavioural specification in rewriting logic, in: Proc. 1st Int. Workshop on Rewriting Logic and its Applications, Asilomar, California, September 1996, North-Holland, Amsterdam, 1996.
19. R. Diaconescu, K. Futatsugi, CafeOBJ Report, AMAST Series in Computing, Vol. 6, World Scientific, Singapore, 1998.
20. R. Diaconescu, J. Goguen, P. Stefaneas, Logical support for modularisation, in: G. Huet, G. Plotkin (Eds.), Logical Environments, Cambridge, 1993. p. 83-130.
21. H. Ehrig, H.J. Kreowski, B. Mahr, P. Padawitz, Algebraic implementation of abstract data types, Theoret. Comput. Sci 20 (1983) 209-263.
22. H. Ehrig, F. Orejas, F. Cornelius, M. Baldamus, Abstract and behaviour module specifications, Technical Report 93-25, Technische Universität Berlin, 1993.
23. S. Eilenberg, J. Wright, Automata in general algebras, Inform. and Control 11 (1967) 452-470.
24. M.C. Gaudel, I. Privara, Context induction: an exercise, Technical Report 687, LRI, Université de Paris-Sud, 1991.
25. V. Giarrantana, F. Gimona, U. Montanari, Observability concepts in abstract data specifications, in: Proc. Conf. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 45, Springer, Berlin, 1976.
26. J. Goguen, Semantics of computation, in: E.G. Manes (Ed.), Category Theory Applied to Computation and Control, Springer, Berlin, 1975. Lecture Notes in Computer Science, Vol. 25, pp. 151-163, also in Proc. Symp. at University of Massachusetts, Amherst, 1974, pp. 234-249.
27. J. Goguen, Semantics of computation, in: E.G. Manes (Ed.), Category Theory Applied to Computation and Control, Springer, Berlin, 1975. Lecture Notes in Computer Science, Vol. 25, pp. 151-163, also in Proc. Symp. at University of Massachusetts, Amherst, 1974, pp. 234-249.
28. J. Goguen, Semantics of computation, in: E.G. Manes (Ed.), Category Theory Applied to Computation and Control, Springer, Berlin, 1975. Lecture Notes in Computer Science, Vol. 25, pp. 151-163, also in Proc. Symp. at University of Massachusetts, Amherst, 1974, pp. 234-249.
29. J. Goguen, Parameterized programming, Trans. Software Eng. SE-10 (5) (1984) 528-543.
30. J. Goguen, Suggestions for using and organizing libraries in software development, in: S. Kartashev, S. Kartashev (Ed.), Proc. 1st Internat. Conf. on Supercomputing Systems, IEEE Computer Society, 1985. Also in Supercomputing Systems, Steven and Svetlana Kartashev (Eds.), Elsevier, Amsterdam, 1986, pp. 349-360.
31. J. Goguen, Suggestions for using and organizing libraries in software development, in: S. Kartashev, S. Kartashev (Ed.), Proc. 1st Internat. Conf. on Supercomputing Systems, IEEE Computer Society, 1985. Also in Supercomputing Systems, Steven and Svetlana Kartashev (Eds.), Elsevier, Amsterdam, 1986, pp. 349-360.
32. J. Goguen, Principles of parameterized programming, in: T. Biggerstaff, A. Perlis (Ed.), Software Reusability, Vol. I: Concepts and Models, Addison-Wesley, Reading, MA, 1989, pp. 159-225.
33. J. Goguen, Higher-order functions considered unnecessary for higher-order programming in: D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading MA, 1990, pp. 309 -352.
34. J. Goguen, Hyperprogramming: formal approach to software environments, in: Proc. Symp. on Formal Approaches to Software Environment Technology, Joint System Development Corporation, Tokyo, Japan, January 1990.
35. J. Goguen, Types as theories, in: G.M. Reed, A.W. Roscoe, R.F. Wachter (Eds.), Topology and Category Theory in Computer Science, Oxford, 1991, pp. 357-390. Proc. Conf. held at Oxford, June 1989, pp. 357-390.
36. J. Goguen, Types as theories, in: G.M. Reed, A.W. Roscoe, R.F. Wachter (Eds.), Topology and Category Theory in Computer Science, Oxford, 1991, pp. 357-390. Proc. Conf. held at Oxford, June 1989, pp. 357-390.
37. J. Goguen, An approach to situated adaptive software, in: Proc. Internat. Workshop on New Models of Software Architecture, NEDO, 1993, pp. 7-20.
38. J. Goguen, Requirements engineering as the reconciliation of social and technical issues, in: M. Jirotka, J. Goguen (Eds.), Requirements Engineering: Social and Technical Issues, Academic Press, New York, 1994. pp. 165-200.
39. J. Goguen, Parameterized programming and software architecture, in: Proc. Reuse'96, IEEE Computer Society, Silver Spring, MD, April 1996, pp. 2-11. Invited keynote address.
40. J. Goguen, Stretching first order equational logic: proofs with partiality, subtypes and retracts, in: M.P. Bonacina, U. Furbach (Eds.), Proc. Workshop on First Order Theorem Proving, Johannes Kepler Univ. Linz, 1997, pp. 78-85. Schloss Hagenberg, Austria, October 1997; RISC-Linz Report No. 95-50; revised version J. Symbolic Comput., to appear.
41. J. Goguen, Theorem Proving and Algebra, MIT, Cambridge, MA, to appear.
42. J. Goguen, R. Burstall, CAT, a system for the structured elaboration of correct programs from structured specifications, Technical Report CSL-118, SRI Computer Science Lab, October 1980.
43. J. Goguen, R. Burstall, Institutions: abstract model theory for specification and programming, J. Assoc. Comput. Mach. 39 (1) (1992) 95-146.
44. J. Goguen, R. Diaconescu, An Oxford survey of order sorted algebra, Math. Struct. Comput. Sci. 4 (1994) 363-392.
45. J. Goguen, R. Diaconescu, Towards an algebraic semantics for the object paradigm, in: H. Ehrig, F. Orejas (Eds.), Proc. 10th Workshop on Abstract Data Types, Lecture Notes in Computer Science, Vol. 785, Springer, Berlin, 1994, pp. 1-29.
46. J. Goguen, G. Malcolm, Proof of correctness of object representation, in: A. William Roscoe, (Ed.), A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice-Hall, Englewood Cliffs, NJ, 1994, pp. 119-142.
47. J. Goguen, G. Malcolm, Situated adaptive software: beyond the object paradigm, in: Proc. Internat. Symp. on New Models of Software Architecture, Information-Technology Promotion Agency, 1995, pp. 126-142.
48. J. Goguen, G. Malcolm, Algebraic Semantics of Imperative Programs, MIT, Cambridge, MA, 1996.
49. J. Goguen, G. Malcolm, Hidden Coinduction: behavioral correctness proofs for objects, Math. Struct. Comput. Sci. 1999, to appear.
50. J. Goguen, G. Malcolm, More higher order programming in OBJ3, in: J. Goguen, G. Malcolm (Eds.), Software Engineering with OBJ: Algebraic Specification in Action, to appear, Kluwer, Boston, 2000.
51. J. Goguen, G. Malcolm, T. Kemp, A hidden Herbrand theorem, in: C. Palamidessi, H. Glaser, K. Meinke (Eds.), Principles of Declarative Programming, Lecture Notes in Computer Science, Vol. 1490, Springer, Berlin, 1998, pp. 445-462.
52. J. Goguen, J. Meseguer, Universal realization, persistent interconnection and implementation of abstract modules, in: M. Nielsen, E.M. Schmidt (Eds.), Proc. 9th Internat. Conf. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 140, Springer, Berlin, 1982, pp. 265-281.
53. J. Goguen, J. Meseguer, Completeness of many-sorted equational logic, Houston J. Math. 11 (3) (1985) 307-334.
54. J. Goguen, J. Meseguer, Eqlog: Equality, types, and generic modules for logic programming, in: D. DeGroot, G. Lindstrom (Eds.), Logic Programming: Functions, Relations and Equations, Prentice Hall, Englewood Cliffs, NJ, 1986, pp. 295-363. An earlier version appears in J. Logic Programming, 1(2) (1984) 179-210.
55. J. Goguen, J. Meseguer, Eqlog: Equality, types, and generic modules for logic programming, in: D. DeGroot, G. Lindstrom (Eds.), Logic Programming: Functions, Relations and Equations, Prentice Hall, Englewood Cliffs, NJ, 1986, pp. 295-363. An earlier version appears in J. Logic Programming, 1(2) (1984) 179-210.
56. J. Goguen, J. Meseguer, Order-sorted algebra solves the constructor selector, multiple representation and coercion problems, in: Proc. 2nd Symp. on Logic in Computer Science, IEEE Computer Society, Silver Spring, MD, 1987, pp. 18-29.
57. J. Goguen, J. Meseguer, Unifying functional, object-oriented and relational programming, with logical semantics, in: B. Shriver, P. Wegner (Eds.), Research Directions in Object-Oriented Programming, MIT, Press, Cambridge, MA, 1987, pp. 417-477.
58. J. Goguen, J. Meseguer, Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoret. Comput. Sci. 105(2) (1992) 217-273. Drafts exists from as early as 1985.
59. J. Goguen, J. Meseguer, D. Plaisted, Programming with parameterized abstract objects in OBJ, in: D. Ferrari, M. Bolognani, J. Goguen (Eds.), Theory and Practice of Software Technology, North-Holland, Amsterdam, 1983, pp. 163-193.
60. J. Goguen, K. Lin, A. Mori, G. Roşu, A. Sato, Distributed cooperative formal methods tools, in: M. Lowry (Ed.), Proc. Automated Software Eng., IEEE, New York, 1997, pp. 55-62.
61. J. Goguen, A. Mori, Semiotics, proofwebs, and distributed cooperative proving, To appear in Proceedings, User Interfaces for Theorem Provers, Sophie-Antipolis, France, 1997.
62. J. Goguen, A. Socorro, Module composition and system design for the object paradigm, J. Object Oriented Programming 7 (9) (1995) 47-55.
63. J. Goguen, J. Thatcher, E. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract data types, in: R. Yeh (Ed.), Current Trends in Programming Methodology, IV, Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 80-149.
64. J. Goguen, J. Thatcher, E. Wagner, J. Wright, Initial algebra semantics and continuous algebras, J. Assoc. Comput. Mach. 24 (1) (1977) 68-95.
65. J. Goguen, W. Tracz, An implementation-oriented semantics for module composition, to appear in G. Leavens and M. Sitaraman (Eds.), Foundations of Component-based Systems, Cambridge University Press, Cambridge, 2000.
66. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, J.P. Jouannaud, Introducing OBJ. in: J. Goguen, G. Malcolms (Eds.), Software Engineering with OBJ: Algebraic Specification in Action, Kluwer Academic Publishers, Boston, 2000.
67. R. Goldblatt, Logics of Time and Computation, 2nd ed., CSLI Lecture Notes, Vol. 7, Center for Studies in Language and Information, Stanford University, 1992.
68. A.D. Gordon, Bisimilarity as a theory of functional programming, Electronic Notes in Theoretical Computer Science, 1, 1995.
69. J. Guttag, The specification and application to programming of abstract data types, Ph.D. thesis, Report CSRG-59. Computer Science Department, University of Toronto, 1975.
70. J. Guttag, Abstract data types and the development of data structures, Comm. Assoc. Comput. Mach. 20 (1977) 297-404.
71. T. Hagino, A typed lambda calculus with categorical type constructors, in: D.H. Pitt, A. Poigne, D.E. Rydeheard (Eds.), Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 283, Springer, Berlin, 1988, pp. 140-157.
72. L. Hamel, Behavioural verification and implementation of an optimizing compiler for OBJ3, Ph.D. Thesis, Oxford University Computing Lab, 1996.
73. R. Hennicker, Context induction: a proof principle for behavioural abstractions, in: A. Miola (Ed.), Proc. Internat. Symp. on the Design and Implementation of Symbolic Computation Systems, Lecture Notes in Computer Science, vol. 429, Springer, Berlin, 1990, pp. 101-110.
74. C.A.R. Hoare, Proof of correctness of data representation, Acta Inform. 1 (1972) 271-281.
75. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.
76. B. Jacobs, Mongruences and cofree coalgebras, in: M. Nivat (Ed.), Algebraic Methodology and Software Technology (AMAST95), Lecture Notes in Computer Science, Vol. 936, Springer, Berlin, 1995, pp. 245-260.
77. B. Jacobs, Objects and classes, coalgebraically, in: B. Freitag, C. Jones, C. Lengauer, H.-J. Schek (Eds.), Object-Orientation with Parallelism and Persistence, Kluwer, Dordrecht, 1996, pp. 83-103.
78. B. Jacobs, Invariants, bisimulations and the correctness of coalgebraic refinements, Technical Report CSI-R9704, Computer Science Institute, University of Nijmegen, March 1997.
79. G. Malcolm, Data structures and program transformation, Sci. Comput. Programming 14 (1990) 255-279.
80. G. Malcolm, Behavioural equivalence, bisimilarity, and minimal realisation, in: M. Haveraaen, O. Owe, O.-J. Dahl (Eds.), Recent Trends in Data Type Specifications, Lecture Notes in Computer Science, Vol. 1130. Springer, Berlin, 1996, pp. 359-378.
81. G. Malcolm, J. Goguen, Proving correctness of refinement and implementation, Technical Monograph PRG-114, Programming Research Group, University of Oxford, 1994.
82. J. Meseguer, Conditional rewriting as a unified model of concurrency, Theoret. Comput. Sci. 96(1) (1992) 73-155.
83. J. Meseguer, J. Goguen, Initiality, induction and computability, in: M. Nivat, J. Reynolds (Eds.), Algebraic Methods in Semantics, Cambridge, 1985, pp. 459-541.
84. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Parts I and II, Technical Report ECS-LFCS-89-85 and -86, University of Edinburgh, Computer Science Department, 1989.
85. E.F. Moore, Gedanken-experiments on sequential machines, in: Automata Studies, Princeton, University Press, Princeton, 1956, pp. 129-153.
86. L. Moss, J. Meseguer, J. Goguen, Final algebras, cosemicomputable algebras, and degrees of unsolvability, Theoret. Comput. Sci. 100 (1992) 267-302. Original version from March 1987.
87. F. Orejas, M. Navarro, A. Sánchez, Algebraic implementation of abstract data types: a survey of concepts and new compositionality results, Math. Struct, in Comput. Sci. 6(1) (1996).
88. D. Parnas, Information distribution aspects of design methodology, Inform. Process. '72, 71 (1972) 339-344. Proc. IFIP Congr., 1972.
89. D. Parnas, Information distribution aspects of design methodology, Inform. Process. '72, 71 (1972) 339-344. Proc. IFIP Congr., 1972.
90. F. Pinheiro, J. Goguen, An object-oriented tool for tracing requirements, IEEE Software (1996) 52-64. Special issue of papers from ICRE '96.
91. H. Reichel, Behavioural equivalence - a unifying concept for initial and final specifications, in: Proc. 3rd Hungarian Comput. Sci. Conf., Akademiai Kiado, Budapest, 1981.
92. H. Reichel, Behavioural validity of conditional equations in abstract data types, in Contributions to General Algebra 3, Teubner, 1985, pp. 301-324. Proc. Vienna Conf. June 21-24, 1984.
93. H. Reichel, Behavioural validity of conditional equations in abstract data types, in Contributions to General Algebra 3, Teubner, 1985, pp. 301-324. Proc. Vienna Conf. June 21-24, 1984.
94. H. Reichel, An approach to object semantics based on terminal co-algebras, Math. Struct. Comput. Sci. 5 (1995) 129-152.
95. G. Roşu, A birkhoff-like axiomatizability result for hidden algebra and coalgebra, in: Proc. 1st Workshop on Coalgebraic Methods in Computer Science (CMCS'98), B. Jacobs, L. Moss, H. Reichel and J. Rutten (Eds.), Lisbon, Portugal, March 1998, Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier, Amsterdam, 1998.
96. G. Roşu, J. Goguen, Hidden congruent deduction, Ricardo Caferra and Gemot Salzer, editors. In Proceedings, International Workshop on First Order Theorem Proving, Technische Universität Wien, pages 213-223, 1998. Schloss Wilhelminenberg, Vienna, November 23-25, 1998. Also, to appear in Lecture Notes in Artificial Intelligence, Springer, 1999.
97. G. Roşu, J. Goguen, Hidden congruent deduction, Ricardo Caferra and Gemot Salzer, editors. In Proceedings, International Workshop on First Order Theorem Proving, Technische Universität Wien, pages 213-223, 1998. Schloss Wilhelminenberg, Vienna, November 23-25, 1998. Also, to appear in Lecture Notes in Artificial Intelligence, Springer, 1999.
98. J. Rutten, Universal coalgebra: a theory of systems, Technical Report CS-R9652, CWI, 1996.
99. J. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J. de Bakker, Jan Willem de Roever, G. Rozenberg (Eds.), Proc. REX Symposium 'A Decade of Concurrency', Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1994, pp. 530-582.
100. D. Sannella, A. Tarlecki, Toward formal development of programs from algebraic specifications, Acta Inform. 25 (1988) 233-281.
101. A. Socorro, Design, Implementation, and Evaluation of a Declarative Object Oriented Language, Ph.D. Thesis, Programming Research Group, Oxford University, 1994.
102. J.M. Spivey, Understanding Z. Cambridge, 1988.
103. W. Tracz, Parameterized programming in LILEANNA, in: Proc., 2nd Internat. Workshop on Software Reuse, Lucca, Italy, March 1993.
104. D. Turi, G. Plotkin, Towards a mathematical operational semantics, in: Proc. Logic in Comput. Sci., IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 280-291.
105. S. Veglioni, Integrating Static and Dynamic Aspects in the Specification of Open, Object-based and Distributed Systems. Ph.D. Thesis, Oxford University Computing Laboratory, 1997.
106. B. van der Waerden, A History of Algebra, Springer, Berlin, 1985.
107. M. Wand, Final algebra semantics and data type extension, J. Comput. System Sci. 19 (1979) 27-44.
108. A.N. Whitehead, A Treatise on Universal Algebra, with Applications, I. Cambridge, 1898. Reprinted 1960.