Category-based modularisation for equational logic programming

Acta Informatica

Volumn 33, Issue 5, 1996, Pages 477-510

  Diaconescu, Rǎzvan ^a  

^a INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030517646     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050054     Document Type: Article

References (57)

1. Andŕeka, H., Németi, I.: A general axiomatizability theorem formulated in terms of cone-injective subcategories. In Csakany, B., Fried, E., Schmidt, E.T. (eds) Universal Algebra, pp. 13-35. Amsterdam; North-Holland 1981. Colloquia Mathematics Societas János Bolyai, 29
2. Andŕeka, H., Németi, I.: A general axiomatizability theorem formulated in terms of cone-injective subcategories. In Csakany, B., Fried, E., Schmidt, E.T. (eds) Universal Algebra, pp. 13-35. Amsterdam; North-Holland 1981. Colloquia Mathematics Societas János Bolyai, 29
3. Barwise, J.: Axioms for abstract model theory. Ann. Math. Logic, 7, 221-265, 1974
4. Barwise, J., Feferman, S.: Model-Theoretic Logics. Berlin.: Springer 1985
5. Birkhoff, G.: On the structure of abstract algebras. Proc. Cambridge Philos. Soc. 31, 433-454, 1935
6. Burstall, R., Goguen, J.: Putting theories together to make specifications. In: Reddy, R., (ed), Proc. 5th Int. Joint Conf. on Artificial Intelligence, pp 1045-1058. Department of Computer Science, Carnegie-Mellon University, 1977
7. Burstall, R., Goguen, J.: The semantics of Clear, a specification language. In: Bjorner, D., (ed) Proc., 1979 Copenhagen Winter School on Abstract Software Specification, pp. 292-332. Springer, 1980. (Lect. Notes in Comput. Sci., volume 86) based on unpublished notes handed out at the Symposium on Algebra and Applications, Stefan Banach Center, Warsaw, Poland 1978
8. Cǎzǎnescu, V.: Local equational logic. In: Esik, Z.: (ed), Proc. 9th Int. Conf. on Fundamentals of Computation Theory FCT'93, pp. 162-170. (Lect. Notes in Comput. Sci., volume 710) Berlin, Springer, 1993.
9. Dershowitz, N.: Computing with rewrite rules. Technical Report ATR-83(8478)-1, The Aerospace Corp., 1983
10. Dershowitz, N., Jouannaud, J.-P.: Rewriting systems. In: van Leeuwen, J., (ed) Handbook of Theoretical Computer Science, Vol. B: Formal Methods and Semantics, pp. 243-320. Amsterdam: North Holland, 1990
11. Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G.: (eds.), Logical Environments, pp. 83-130. Cambridge 1993. Proc. Workshop held in Edinburgh, Scotland, May 1991
12. Diaconescu, R.: Completeness of semantic paramodulation: a category-based approach. International Journal of Foundations of Computer Science. To appear
13. Diaconescu, R.: The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1990
14. Diaconescu, R.: Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, University of Oxford, 1994
15. Diaconescu, R.: Completeness of category-based equational deduction. Math. Struct. Comput. Sci., (to appear)
16. Goguen, J.: Reusing and interconnecting software components. Computer, 19: 16-28, (1986). Reprinted in Tutorial: Software Reusability, Freeman, P. (ed) IEEE Computer Society, 1987, pp. 251-263, in: Prieto-Díaz, R., and Arango, G., (eds), Domain Analysis and Software Systems Modelling, IEEE Computer Society 1991.
17. Goguen, J.: Reusing and interconnecting software components. Computer, 19: 16-28, (1986). Reprinted in Tutorial: Software Reusability, Freeman, P. (ed) IEEE Computer Society, 1987, pp. 251-263, in: Prieto-Díaz, R., and Arango, G., (eds), Domain Analysis and Software Systems Modelling, IEEE Computer Society 1991.
18. Goguen, J., What is unification? A categorical view of substitution, equation and solution. In: Nivat, M., Aït-Kaci, H., (eds), Resolution of Equations in Algebraic Structures, Vol. 1: Algebraic Techniques, pp. 217-261. New York: Academic, 1989. Also Report SRI-CSL-88-2R2, SRI International, Computer Science Lab, August 1988
19. Goguen, J.: Theorem Proving and Algebra. New York: MIT (to appear)
20. Goguen, J., Burstall, R.: A study in the foundations of programming methodology: Specifications, institutions, charters and parchments. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D., (eds), Proc. Conf. on Category Theory and Computer Programming, pp. 313-333. Lect. Notes in Comput. Sci. vol. 240, Berlin, Springer, 1986. also, Report CSLI-86-54, Center for the Study of Language and Information, Stanford University, June 1986
21. Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. J. Assoc. Comput. Machinery, 39:95-146 (1992). Draft appears as Report ECS-LFCS-90-106, Computer Science Department, University of Edinburgh, January 1990
22. Goguen, J., Diaconescu, R.: An Oxford survey of order sorted algebra. Math. Struct. Comput. Sci. 4:363-392, 1994
23. Goguen, J., Meseguer, J.: Completeness of many-sorted equational logic. Houston J. Math. 11:307-334 (1985). Preliminary versions have appeared in: SIGPLAN Notices, Vol. 16, pp. 24-37 (1981); SRI Computer Science Lab, Report CSL-135, May 1982
24. Goguen, J., Meseguer, J.: Completeness of many-sorted equational logic. Houston J. Math. 11:307-334 (1985). Preliminary versions have appeared in: SIGPLAN Notices, Vol. 16, pp. 24-37 (1981); SRI Computer Science Lab, Report CSL-135, May 1982
25. Goguen, J., Meseguer, J.: Completeness of many-sorted equational logic. Houston J. Math. 11:307-334 (1985). Preliminary versions have appeared in: SIGPLAN Notices, Vol. 16, pp. 24-37 (1981); SRI Computer Science Lab, Report CSL-135, May 1982
26. Goguen, J., Meseguer, J.: Eqlog: Equality, types, and generic modules for logic programming. In: DeGroot, D., Lindstrom, G. (eds), Logic Programming: Functions, Relations and Equations, pp. 295-363. Englewood Cliffs, NJ: Prentice-Hall 1986. An earlier version appears in J. Logic Programming 1, 179-210 (1984)
27. Goguen, J., Meseguer, J.: Eqlog: Equality, types, and generic modules for logic programming. In: DeGroot, D., Lindstrom, G. (eds), Logic Programming: Functions, Relations and Equations, pp. 295-363. Englewood Cliffs, NJ: Prentice-Hall 1986. An earlier version appears in J. Logic Programming 1, 179-210 (1984)
28. Goguen, J., and Meseguer, J.: Models and equality for logical programming. In: Ehrig, H., Levi, G., Kowalski, R., Montanari, U. (eds), Proc. 1987 TAPSOFT, pp. 1-22. (Lect. Notes in Comput. Sci. vol. 250) Berlin, Springer, 1987.
29. Goguen, J., Meseguer, J.: Unifying functional, object-oriented and relational programming, with logical semantics. In: Shriver, B., Wegner, P. (eds) Research Directions in Object-Oriented Programming, pp. 417-477. New York, MIT, 1987. Preliminary version in SIGPLAN Notices, 21, 153-162, (1986)
30. Goguen, J., Meseguer, J.: Unifying functional, object-oriented and relational programming, with logical semantics. In: Shriver, B., Wegner, P. (eds) Research Directions in Object-Oriented Programming, pp. 417-477. New York, MIT, 1987. Preliminary version in SIGPLAN Notices, 21, 153-162, (1986)
31. Goguen, J., and Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105, 217-273 (1992). Also, Programming Research Group Tech. Monograph PRG-80, Oxford University, December 1989
32. Goguen, J., Thatcher, J., Wagner, E.: An initial algebra approach to the specification, correctness and implementation of abstract data types. Tech. Report RC 6487, IBM T.J. Watson Research Center, October 1976. In: Yeh, R., (ed), Current Trends in Programming Methodology, IV, Englewood Cliffs: Prentice-Hall 1978
33. Goguen, J., Thatcher, J., Wagner, E.: An initial algebra approach to the specification, correctness and implementation of abstract data types. Tech. Report RC 6487, IBM T.J. Watson Research Center, October 1976. In: Yeh, R., (ed), Current Trends in Programming Methodology, IV, Englewood Cliffs: Prentice-Hall 1978
34. Goguen, J., Winkler, T., Meseguer, J, Futatsugi, K., Jouannaud, J.-P., Introducing OBJ. In: Goguen, J., (ed), Algebraic Specification with OBJ: An Introduction with Case Studies. Cambridge, to appear 1995. Also to appear as Tech. Report from SRI International
35. Goguen, J., Wolfram, D.: On types and FOOPS. In: Meersman, R., Kent, W., Khosla, S. (eds), Object Oriented Databases: Analysis, Design and Construction, pp. 1-22. Noith Holland, 1991. Proc. IFIP TC2 Conf. Windermere, UK, 2-6 July 1990
36. Huet, G., Oppen, D.: Equations and rewrite rules: a survey. In: Book, R. (ed), Formal Language Theory: Perspectives and Open Problems, pp. 349-405. New York: Academic, 1980
37. Adamek, H.H.J., Strecker, G.: Abstract and Concrete Categories. New York: Wiley 1990
38. Klop, J.W.: Term rewriting systems: from Church-Rosser to Knuth-Bendix and beyond. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds), Handbook of Logic in Computer Science. Oxford 1992
39. MacLane, S., Categories for the Working Mathematician. Berlin: Springer, 1971
40. Lassez, J.-L., Maher, M., Marriott, K.: Unification revisited. In: Minker, J., (ed.), Foundations of Deductive Databases and Logic Programming, pp. 587-625. Los Altos, CA: Morgan Kaufmann, 1988
41. Meseguer, J., General logics. In: Ebbinghaus, H.-D. et al., (eds.), Proc. Logic Colloquium, 1987, pp. 275-329. Amsterdam: North-Holland 1989
42. Mosses, P.: Unified algebras and institutions. In: Proc. 4th Annual Conf. on Logic in Computer Science, pp. 304-312. New York: IEEE 1989
43. Parnas, D.: Information distribution aspects of design methodology. Inform. Processing '72, 71, 339-344 (1972) Proc. 1972 IFIP Congress
44. Parnas, D.: On the criteria to be used in decomposing systems into modules. Commun. Assoc. Comput. Machinery, 15, 1053-1058 (1972)
45. Parnas, D.: A technique for software module specification. Commun. Assoc. Comput. Machinery 15, 330-336 (1972)
46. Rodenburg, P.-H.: A simple algebraic proof of the equational interpolation theorem. Algebra Universalis, 28, 48-51 (1991)
47. Sannella, D., Tarlecki, A.: Extended ML: an institution independent framework for formal program development. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds.) Proc. Summer Workshop on Category Theory and Computer Programming, pp. 364-389. Springer, 1986, Berlin. (Lect. Notes in Comput. Sci., vol. 240)
48. Sannella, D., Tarlecki, A.: On observational equivalence and algebraic specification. J. Comput. System Sci. 34, 150-178 (1987) Earlier version in Proc. Colloq. on Trees in Algebra and Programming, (Lect. Notes in Comput. Sci., vol. 185), Berlin: Springer, 1985
49. Sannella, D., Tarlecki, A.: On observational equivalence and algebraic specification. J. Comput. System Sci. 34, 150-178 (1987) Earlier version in Proc. Colloq. on Trees in Algebra and Programming, (Lect. Notes in Comput. Sci., vol. 185), Berlin: Springer, 1985
50. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Inform. Control 76, 165-210, (1988). Earlier version in Proc. Int. Symp. on the Semantics of Data Types (Lect. Notes in Comput. Sci., vol. 173) Berlin: Springer, 1985
51. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Inform. Control 76, 165-210, (1988). Earlier version in Proc. Int. Symp. on the Semantics of Data Types (Lect. Notes in Comput. Sci., vol. 173) Berlin: Springer, 1985
52. Street, R.: The formal theory of monads. J. Pure Appl. Algebra, (2), 149-169 (1972)
53. Tarlecki, A.: Free constructions in algebraic institutions. In: M.P. Chytil, M.P., Koubek, V. (eds.), Proc. Int. Symp. on Mathematical Foundations of Computer Science, pp. 526-534. (Lect. Notes in Computer Science, vol. 176) Berlin: Springer, 1984. extended version, University of Edinburgh, Computer Science Department, Report CSR-149-83
54. Tarlecki, A.: Bits and pieces of the theory of institutions. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds.), Proceedings, Summer Workshop on Category Theory and Computer Programming, pp. 334-360. Berlin: Springer 1986. (Lect. Notes in Comput. Sci., vol. 240)
55. Tarlecki, A.: On the existence of free models in abstract algebraic institutions. Theoret. Comput. Sci., 37, 269-304 (1986) Preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165-84, 1984
56. Tarlecki, A.: Quasi-varieties in abstract algebraic institutions. J. Comput. System Sci., 33, 333-360 (1986) Original version, University of Edinburgh, Report CSR-173-84
57. Tarski, A.: The semantic conception of truth. Philos. Phenomenological Res., 4, 13-47 (1944)