{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:44:54Z","timestamp":1747579494241},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/s002360050054","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T07:47:25Z","timestamp":1030261645000},"page":"477-510","source":"Crossref","is-referenced-by-count":5,"title":["Category-based modularisation for equational logic programming"],"prefix":"10.1007","volume":"33","author":[{"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60330477236_CR1","first-page":"13","volume-title":"Universal Algebra","author":"H. And\u0155eka","year":"1981","unstructured":"And\u0155eka, H., N\u00e9meti, I.: A general axiomatizability theorem formulated in terms of coneinjective subcategories. In Csakany, B., Fried, E., Schmidt, E.T. (eds) Universal Algebra, pp. 13\u201335. Amsterdam; North-Holland 1981. Colloquia Mathematics Societas J\u00e1nos Bolyai, 29"},{"key":"60330477236_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0003-4843(74)90016-3","volume":"7","author":"J. Barwise","year":"1974","unstructured":"Barwise, J.: Axioms for abstract model theory. Ann. Math. Logic, 7, 221\u2013265, 1974","journal-title":"Ann. Math. Logic"},{"key":"60330477236_CR3","volume-title":"Model-Theoretic Logics","author":"J. Barwise","year":"1985","unstructured":"Barwise, J., Feferman, S.: Model-Theoretic Logics. Berlin: Springer 1985"},{"key":"60330477236_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Birkhoff, G.: On the structure of abstract algebras. Proc. Cambridge Philos. Soc. 31, 433\u2013454, 1935","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"60330477236_CR5","unstructured":"Burstall, R., Goguen, J.: Putting theories together to make specifications. In: Reddy, R., (ed), Proc. 5th Int. Joint Conf. on Artificial Intelligence, pp 1045\u20131058. Department of Computer Science, Carnegie-Mellon University, 1977"},{"key":"60330477236_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013332. 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","DOI":"10.1007\/3-540-10007-5_41"},{"key":"60330477236_CR7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-57163-9_12","volume-title":"Proc. 9th Int. Conf. on Fundamentals of Computation Theory FCT\u201993","author":"V. C\u0103z\u0103nescu","year":"1993","unstructured":"C\u0103z\u0103nescu, V.: Local equational logic. In: Esik, Z.: (ed), Proc. 9th Int. Conf. on Fundamentals of Computation Theory FCT\u201993, pp. 162\u2013170. (Lect. Notes in Comput. Sci., volume 710) Berlin, Springer, 1993."},{"key":"60330477236_CR8","unstructured":"Dershowitz, N.: Computing with rewrite rules. Technical Report ATR-83(8478)-l, The Aerospace Corp., 1983"},{"key":"60330477236_CR9","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, Vol. B: Formal Methods and Semantics","author":"N. Dershowitz","year":"1990","unstructured":"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\u2013320. Amsterdam: North Holland, 1990"},{"key":"60330477236_CR10","unstructured":"Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G.: (eds.), Logical Environments, pp. 83\u2013130. Cambridge 1993. Proc. Workshop held in Edinburgh, Scotland, May 1991"},{"key":"60330477236_CR11","unstructured":"Diaconescu, R.: Completeness of semantic paramodulation: a category-based approach. International Journal of Foundations of Computer Science. To appear"},{"key":"60330477236_CR12","unstructured":"Diaconescu, R.: The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1990"},{"key":"60330477236_CR13","unstructured":"Diaconescu, R.: Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, University of Oxford, 1994"},{"key":"60330477236_CR14","unstructured":"Diaconescu, R.: Completeness of category-based equational deduction. Math. Struct. Comput. Sci., (to appear)"},{"key":"60330477236_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/MC.1986.1663146","volume":"19","author":"J. Goguen","year":"1986","unstructured":"Goguen, J.: Reusing and interconnecting software components. Computer, 19:16\u201328, (1986). Reprinted in Tutorial: Software Reusability, Freeman, P. (ed) IEEE Computer Society, 1987, pp. 251\u2013263, in: Prieto-D\u00edaz, R., and Arango, G., (eds), Domain Analysis and Software Systems Modelling, IEEE Computer Society 1991.","journal-title":"Computer"},{"key":"60330477236_CR16","first-page":"217","volume-title":"Resolution of Equations in Algebraic Structures, Vol. 1: Algebraic Techniques","author":"J. Goguen","year":"1989","unstructured":"Goguen, J., What is unification? A categorical view of substitution, equation and solution. In: Nivat, M., A\u00eft-Kaci, H., (eds), Resolution of Equations in Algebraic Structures, Vol. 1: Algebraic Techniques, pp. 217\u2013261. New York: Academic, 1989. Also Report SRI-CSL-88-2R2, SRI International, Computer Science Lab, August 1988"},{"key":"60330477236_CR17","unstructured":"Goguen, J.: Theorem Proving and Algebra. New York: MIT (to appear)"},{"key":"60330477236_CR18","series-title":"Lect. Notes in Comput. Sci. vol. 240","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-17162-2_131","volume-title":"Proc. Conf. on Category Theory and Computer Programming","author":"J. Goguen","year":"1986","unstructured":"Goguen, J., Burstall, R.: A study in the foundations of programming methodology: Specifications, institutions, charters and parchments. In: Pitt, D., Abramsky, S., Poign\u00e9, A., Rydeheard, D., (eds), Proc. Conf. on Category Theory and Computer Programming, pp. 313\u2013333. 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"},{"key":"60330477236_CR19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. J. Assoc. Comput. Machinery, 39:95\u2013146 (1992). Draft appears as Report ECS-LFCS-90-106, Computer Science Department, University of Edinburgh, January 1990","journal-title":"J. Assoc. Comput. Machinery"},{"key":"60330477236_CR20","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S0960129500000517","volume":"4","author":"J. Goguen","year":"1994","unstructured":"Goguen, J., Diaconescu, R.: An Oxford survey of order sorted algebra. Math. Struct. Comput. Sci. 4:363\u2013392, 1994","journal-title":"Math. Struct. Comput. Sci."},{"key":"60330477236_CR21","first-page":"307","volume":"11","author":"J. Goguen","year":"1985","unstructured":"Goguen, J., Meseguer, J.: Completeness of many-sorted equational logic. Houston J. Math. 11:307\u2013334 (1985). Preliminary versions have appeared in: SIGPLAN Notices, Vol. 16, pp. 24\u201337 (1981); SRI Computer Science Lab, Report CSL-135, May 1982","journal-title":"Houston J. Math."},{"key":"60330477236_CR22","first-page":"295","volume-title":"Logic Programming: Functions, Relations and Equations","author":"J. Goguen","year":"1986","unstructured":"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\u2013363. Englewood Cliffs, NJ: Prentice-Hall 1986. An earlier version appears in J. Logic Programming 1, 179\u2013210 (1984)"},{"key":"60330477236_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0014969","volume-title":"Proc. 1987 TAPSOFT","author":"J. Goguen","year":"1987","unstructured":"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\u201322. (Lect. Notes in Comput. Sci. vol. 250) Berlin, Springer, 1987."},{"key":"60330477236_CR24","first-page":"417","volume-title":"Research Directions in ObjectOriented Programming","author":"J. Goguen","year":"1987","unstructured":"Goguen, J., Meseguer, J.: Unifying functional, object-oriented and relational programming, with logical semantics. In: Shriver, B., Wegner, P. (eds) Research Directions in ObjectOriented Programming, pp. 417\u2013477. New York, MIT, 1987. Preliminary version in SIGPLAN Notices, 21, 153\u2013162, (1986)"},{"key":"60330477236_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., and Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105, 217\u2013273 (1992). Also, Programming Research Group Tech. Monograph PRG-80, Oxford University, December 1989","journal-title":"Theoret. Comput. Sci."},{"key":"60330477236_CR26","volume-title":"Current Trends in Programming Methodology, IV","author":"J. Goguen","year":"1978","unstructured":"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"},{"key":"60330477236_CR27","unstructured":"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"},{"key":"60330477236_CR28","unstructured":"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\u201322. North Holland, 1991. Proc. IFIP TC2 Conf. Windermere, UK, 2\u20136 July 1990"},{"key":"60330477236_CR29","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"Huet, G., Oppen, D.: Equations and rewrite rules: a survey. In: Book, R. (ed), Formal Language Theory: Perspectives and Open Problems, pp. 349\u2013405. New York: Academic, 1980"},{"key":"60330477236_CR30","volume-title":"Abstract and Concrete Categories","author":"H.H.J. Adamek","year":"1990","unstructured":"Adamek, H.H.J., Strecker, G.: Abstract and Concrete Categories. New York: Wiley 1990"},{"key":"60330477236_CR31","unstructured":"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"},{"key":"60330477236_CR32","volume-title":"Categories for the Working Mathematician","author":"S. MacLane","year":"1971","unstructured":"MacLane, S., Categories for the Working Mathematician. Berlin: Springer, 1971"},{"key":"60330477236_CR33","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"Lassez, J.-L., Maher, M., Marriott, K.: Unification revisited. In: Minker, J., (ed.), Foundations of Deductive Databases and Logic Programming, pp. 587\u2013625. Los Altos, CA: Morgan Kaufmann, 1988"},{"key":"60330477236_CR34","first-page":"275","volume-title":"Proc. Logic Colloquium","author":"J. Meseguer","year":"1987","unstructured":"Meseguer, J., General logics. In: Ebbinghaus, H.-D. et al., (eds.), Proc. Logic Colloquium, 1987, pp. 275\u2013329. Amsterdam: North-Holland 1989"},{"key":"60330477236_CR35","first-page":"304","volume-title":"Proc. 4th Annual Conf. on Logic in Computer Science","author":"P. Mosses","year":"1989","unstructured":"Mosses, P.: Unified algebras and institutions. In: Proc. 4th Annual Conf. on Logic in Computer Science, pp. 304\u2013312. New York: IEEE 1989"},{"key":"60330477236_CR36","first-page":"339","volume":"71","author":"D. Parnas","year":"1972","unstructured":"Parnas, D.: Information distribution aspects of design methodology. Inform. Processing \u201972, 71, 339\u2013344 (1972) Proc. 1972 IFIP Congress","journal-title":"Inform. Processing \u201972"},{"key":"60330477236_CR37","first-page":"1053","volume":"15","author":"D. Parnas","year":"1972","unstructured":"Parnas, D.: On the criteria to be used in decomposing systems into modules. Commun. Assoc. Comput. Machinery, 15, 1053\u20131058 (1972)","journal-title":"Commun. Assoc. Comput. Machinery"},{"key":"60330477236_CR38","first-page":"330","volume":"15","author":"D. Parnas","year":"1972","unstructured":"Parnas, D.: A technique for software module specification. Commun. Assoc. Comput. Machinery 15, 330\u2013336 (1972)","journal-title":"Commun. Assoc. Comput. Machinery"},{"key":"60330477236_CR39","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01190411","volume":"28","author":"P.-H. Rodenburg","year":"1991","unstructured":"Rodenburg, P.-H.: A simple algebraic proof of the equational interpolation theorem. Algebra Universalis, 28, 48\u201351 (1991)","journal-title":"Algebra Universalis"},{"key":"60330477236_CR40","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-17162-2_133","volume-title":"Proc. Summer Workshop on Category Theory and Computer Programming","author":"D. Sannella","year":"1986","unstructured":"Sannella, D., Tarlecki, A.: Extended ML: an institution independent framework for formal program development. In: Pitt, D., Abramsky, S., Poign\u00e9, A., Rydeheard, D. (eds.) Proc. Summer Workshop on Category Theory and Computer Programming, pp. 364\u2013389. Springer, 1986, Berlin. (Lect. Notes in Comput. Sci., vol. 240)"},{"key":"60330477236_CR41","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(87)90023-7","volume":"34","author":"D. Sannella","year":"1987","unstructured":"Sannella, D., Tarlecki, A.: On observational equivalence and algebraic specification. J. Comput. System Sci. 34, 150\u2013178 (1987) Earlier version in Proc. Colloq. on Trees in Algebra and Programming, (Lect. Notes in Comput. Sci., vol. 185), Berlin: Springer, 1985","journal-title":"J. Comput. System Sci."},{"key":"60330477236_CR42","first-page":"165","volume":"76","author":"D. Sannella","year":"1988","unstructured":"Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Inform. Control 76, 165\u2013210, (1988). Earlier version in Proc. Int. Symp. on the Semantics of Data Types (Lect. Notes in Comput. Sci., vol. 173) Berlin: Springer, 1985","journal-title":"Inform. Control"},{"key":"60330477236_CR43","doi-asserted-by":"crossref","unstructured":"Street, R.: The formal theory of monads. J. Pure Appl. Algebra, (2), 149\u2013169 (1972)","DOI":"10.1016\/0022-4049(72)90019-9"},{"key":"60330477236_CR44","first-page":"526","volume-title":"Proc. Int. Symp. on Mathematical Foundations of Computer Science","author":"A. Tarlecki","year":"1984","unstructured":"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\u2013534. (Lect. Notes in Computer Science, vol. 176) Berlin: Springer, 1984. extended version, University of Edinburgh, Computer Science Department, Report CSR-149-83"},{"key":"60330477236_CR45","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-17162-2_132","volume-title":"Proceedings, Summer Workshop on Category Theory and Computer Programming","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A.: Bits and pieces of the theory of institutions. In: Pitt, D., Abramsky, S., Poign\u00e9, A., Rydeheard, D. (eds.), Proceedings, Summer Workshop on Category Theory and Computer Programming, pp. 334\u2013360. Berlin: Springer 1986. (Lect. Notes in Comput. Sci., vol. 240)"},{"key":"60330477236_CR46","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0304-3975(85)90094-5","volume":"37","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A.: On the existence of free models in abstract algebraic institutions. Theoret. Comput. Sci., 37, 269\u2013304 (1986) Preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165-84, 1984","journal-title":"Theoret. Comput. Sci."},{"key":"60330477236_CR47","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0022-0000(86)90057-7","volume":"33","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A.: Quasi-varieties in abstract algebraic institutions. J. Comput. System Sci., 33, 333\u2013360 (1986) Original version, University of Edinburgh, Report CSR-173-84","journal-title":"J. Comput. System Sci."},{"key":"60330477236_CR48","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2102968","volume":"4","author":"A. Tarski","year":"1944","unstructured":"Tarski, A.: The semantic conception of truth. Philos. Phenomenological Res., 4, 13\u201347 (1944)","journal-title":"Philos. Phenomenological Res."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s002360050054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s002360050054\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002360050054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s002360050054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T21:09:58Z","timestamp":1652735398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s002360050054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["60330477236"],"URL":"https:\/\/doi.org\/10.1007\/s002360050054","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}