{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:07:37Z","timestamp":1759032457279,"version":"3.40.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Categorical Structures"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1008607717635","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T15:12:40Z","timestamp":1040569960000},"page":"427-453","source":"Crossref","is-referenced-by-count":27,"title":["Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages"],"prefix":"10.1007","volume":"6","author":[{"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"161316_CR1","unstructured":"Arrais, M. and Fiadeiro, J. L.: Unifying theories in different institutions, in Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science, Springer, 1996, pp. 81\u2013101."},{"key":"161316_CR2","unstructured":"Burstall, Rod and Diaconescu, R\u0102zvan: Hiding and behaviour: an institutional approach, in A. William Roscoe (ed.), A Classical Mind: Essays in Honour of C. A. R. Hoare, Prentice-Hall, 1994, pp. 75\u201392. Also in Technical Report ECS-LFCS-8892\u2013253, Laboratory for Foundations of Computer Science, University of Edinburgh, 1992."},{"key":"161316_CR3","doi-asserted-by":"crossref","unstructured":"Burstall, Rod and Goguen, Joseph: The semantics of Clear, a specification language, in Dines Bjorner (ed.), Proceedings, 1979 Copenhagen Winter School on Abstract Software Specification, Lecture Notes in Computer Science 86, Springer, 1980, pp. 292\u2013332; 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":"161316_CR4","doi-asserted-by":"crossref","unstructured":"C\u0102z\u0102nescu, Virgil Emil and Ro\u015fu, Grigore: Weak inclusion systems, Math. Structures Comput. Sci.\n7(2) (1997).","DOI":"10.1017\/S0960129596002253"},{"key":"161316_CR5","unstructured":"Diaconescu, R\u0102zvan: Category-based semantics for equational and constraint logic programming, PhD Thesis, University of Oxford, 1994."},{"issue":"1","key":"161316_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S0960129500000621","volume":"5","author":"R. Diaconescu","year":"1995","unstructured":"Diaconescu, R\u0102zvan: Completeness of category-based equational deduction, Math. Structures Comput. Sci.\n5(1) (1995), 9\u201341.","journal-title":"Math. Structures Comput. Sci."},{"key":"161316_CR7","unstructured":"Diaconescu, R\u0102zvan: Behavioural rewriting logic: Semantic foundations and proof theory, October 1996. Submitted for publication."},{"key":"161316_CR8","doi-asserted-by":"crossref","unstructured":"Diaconescu, R\u0102zvan: A category-based equational logic semantics to constraint programming, in Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science 1130, Springer, 1996, pp. 200\u2013221.","DOI":"10.1007\/3-540-61629-2_44"},{"issue":"5","key":"161316_CR9","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s002360050054","volume":"33","author":"R. Diaconescu","year":"1996","unstructured":"Diaconescu, R\u0102zvan: Category-based modularisation for equational logic programming, Acta Inform.\n33(5) (1996), 477\u2013510.","journal-title":"Acta Inform."},{"key":"161316_CR10","doi-asserted-by":"crossref","unstructured":"Diaconescu, R\u0102zvan: Foundations of behavioural specification in rewriting logic, in Proceedings, First International Workshop on Rewriting Logic and its Applications. Asilomar, California, September 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, 1996.","DOI":"10.1016\/S1571-0661(04)00041-6"},{"key":"161316_CR11","unstructured":"Diaconescu, R\u0102zvan and Futatsugi, Kokichi: Logical semantics for CafeOBJ. Technical Report IS-RR-96\u20130024S, Japan Advanced Institute for Science and Technology, 1996. Submitted for publication."},{"key":"161316_CR12","doi-asserted-by":"crossref","unstructured":"Diaconescu, R\u0102zvan and Futatsugi, Kokichi: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, volume 6 of AMAST Series in Computing, World Scientific, 1998. To appear.","DOI":"10.1142\/3831"},{"key":"161316_CR13","unstructured":"Diaconescu, R\u0102zvan, Goguen, Joseph and Stefaneas, Petros: Logical support for modularisation, in Gerard Huet and Gordon Plotkin (eds.), Logical Environments, Proceedings of a Workshop held in Edinburgh, Scotland, May 1991, Cambridge, 1993, pp. 83\u2013130."},{"key":"161316_CR14","unstructured":"Goguen, Joseph: Theorem Proving and Algebra, MIT, to appear. http:\/\/www-cse. ucsd.edu\/users\/goguen\/pubs\/index.html."},{"issue":"1","key":"161316_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Goguen, Joseph and Burstall, Rod: Institutions: Abstract model theory for specification and programming, J. Assoc. Comput. Mach.\n39(1) (1992), 95\u2013146.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"161316_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0960129500000517","volume":"4","author":"J. Goguen","year":"1994","unstructured":"Goguen, Joseph and Diaconescu, R\u0102zvan: An Oxford survey of order sorted algebra, Math. Structures Comput. Sci.\n4(4) (1994) 363\u2013392.","journal-title":"Math. Structures Comput. Sci."},{"key":"161316_CR17","doi-asserted-by":"crossref","unstructured":"Goguen, Joseph and Diaconescu, R\u0102zvan: Towards an algebraic semantics for the object paradigm, in Harmut Ehrig and Fernando Orejas (eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science 785, Springer, 1994, pp. 1\u201334.","DOI":"10.1007\/3-540-57867-6_1"},{"key":"161316_CR18","doi-asserted-by":"crossref","unstructured":"Goguen, Joseph and Diaconescu, R\u0102zvan: An introduction to category-based equational logic, in V. S. Alagar and Maurice Nivat (eds.), Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 936, Springer, 1995, pp. 91\u2013126.","DOI":"10.1007\/3-540-60043-4_48"},{"key":"161316_CR19","unstructured":"Goguen, Joseph and Malcolm, Grant: A hidden agenda, 1996. draft, http:\/\/www-cse. ucsd.edu\/users\/goguen\/pubs\/index.html."},{"key":"161316_CR20","doi-asserted-by":"crossref","unstructured":"Goguen, Joseph and Meseguer, Jos\u00e9: Eqlog: Equality, types, and generic modules for logic programming, in Douglas DeGroot and Gary Lindstron (eds.), Logic Programming: Functions, Relations and Equations, Prentice-Hall, 1986, pp. 295\u2013363. An earlier version appears in J. Logic Programming\n1(2) (1984), 179\u2013210.","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"161316_CR21","doi-asserted-by":"crossref","unstructured":"Goguen, Joseph and Meseguer, Jos\u00e9: Models and equality for logical programming, in Hartmut Ehrig, Giorgio Levi, Robert Kowalski and Ugo Montanari (eds.), Proceedings, 1987 TAPSOFT, Lecture Notes in Computer Science 250, Springer, 1987, pp. 1\u201322.","DOI":"10.1007\/BFb0014969"},{"issue":"2","key":"161316_CR22","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J. Goguen","year":"1992","unstructured":"Goguen, Joseph and Meseguer, Jos\u00e9: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoret. Comput. Sci.\n105(2) (1992), 217\u2013273. Also, Programming Research Group Technical Monograph PRG-80, Oxford University, December 1989.","journal-title":"Theoret. Comput. Sci."},{"key":"161316_CR23","unstructured":"Goguen, Joseph, Thatcher, James and Wagner, Eric: An initial algebra approach to the specification, correctness and implementation of abstract data types, Technical Report RC 6487, IBM T. J. Watson Research Center, October 1976. In Current Trends in Programming Methodology, IV, Raymond Yeh (ed.), Prentice-Hall, 1978, pp. 80\u2013149."},{"key":"161316_CR24","unstructured":"Goguen, Joseph, Winkler, Timothy, Meseguer, Jos\u00e9, Futatsugi, Kokichi and Jouannaud, Jean-Pierre: Introducing OBJ, in Joseph Goguen (ed.), Algebraic Specification with OBJ: An Introduction with Case Studies, Cambridge, to appear 1995. Also to appear as Technical Report from SRI International."},{"key":"161316_CR25","unstructured":"Herrlich, Horst, Adamek, Jiri and Strecker, George: Abstract and Concrete Categories, Wiley, 1990."},{"key":"161316_CR26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1017\/S0960129500000712","volume":"5","author":"H.-J. Kreowski","year":"1995","unstructured":"Kreowski, H.-J. and Mossakovski, Till: Equivalence and difference between institutions: Simulating Horn clause logic with based algebras, Math. Struct. Comput. Sci.\n5 (1995), 189\u2013215.","journal-title":"Math. Struct. Comput. Sci."},{"key":"161316_CR27","doi-asserted-by":"crossref","unstructured":"Mac Lane, Saunders: Categories for the Working Mathematician, Springer, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"161316_CR28","unstructured":"Lincoln, P., Clavel, M., Eker, S. and Meseguer, J.: Principles of Maude, in Proceedings, First International Workshop on Rewriting Logic and its Applications. Asilomar, California, September 1996, Electronic Notes in Theoretical Computer Science 4, Elsevier, 1996."},{"key":"161316_CR29","doi-asserted-by":"crossref","unstructured":"Meseguer, Jos\u00e9: Membership algebra as a logical framework for equational specification. Invited paper at the Workshop on Algebraic Development Techniques, Tarquinia, 1997.","DOI":"10.1007\/3-540-64299-4_26"},{"key":"161316_CR30","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, Jos\u00e9: Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci.\n96 (1992), 73\u2013155.","journal-title":"Theoret. Comput. Sci."},{"key":"161316_CR31","unstructured":"Meseguer, Jos\u00e9 and Goguen, Joseph: Initiality, induction and computability, in Maurice Nivat and John Reynolds (eds.), Algebraic Methods in Semantics, Cambridge, 1985, pp. 459\u2013541."},{"key":"161316_CR32","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(85)90094-5","volume":"37","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, Andrzej: On the existence of free models in abstract algebraic institutions, Theoret. Comput. Sci.\n37 (1986), 269\u2013304. Preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165\u201384, 1984.","journal-title":"Theoret. Comput. Sci."},{"key":"161316_CR33","doi-asserted-by":"crossref","unstructured":"Tarlecki, Andrzej: Moving between logical systems, in Magne Haveraaen, Olaf Owe and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science, Springer, 1996, pp. 478\u2013502.","DOI":"10.1007\/3-540-61629-2_59"},{"key":"161316_CR34","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(91)90085-G","volume":"91","author":"A. Tarlecki","year":"1991","unstructured":"Tarlecki, Andrzej, Burstall, Rod and Goguen, Joseph: Some fundamental algebraic tools for the semantics of computation, Part 3: Indexed categories, Theoret. Comput. Sci.\n91 (1991) 239\u2013264. Also, Monograph PRG-77, August 1989, Programming Research Group, Oxford University.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008607717635.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008607717635\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008607717635.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:27:14Z","timestamp":1747578434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008607717635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["161316"],"URL":"https:\/\/doi.org\/10.1023\/a:1008607717635","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"type":"print","value":"0927-2852"},{"type":"electronic","value":"1572-9095"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}