{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:38:23Z","timestamp":1772026703217,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4003,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0304-3975(01)00361-9","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"289-318","source":"Crossref","is-referenced-by-count":74,"title":["Logical foundations of CafeOBJ"],"prefix":"10.1016","volume":"285","author":[{"given":"R\u0103zvan","family":"Diaconescu","sequence":"first","affiliation":[]},{"given":"Kokichi","family":"Futatsugi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00361-9_BIB1","doi-asserted-by":"crossref","unstructured":"R. Burstall, J. Goguen, The semantics of Clear, a specification language, in: D. Bjorner (Ed.), Proceedings, 1979 Copenhagen Winter School on Abstract Software Specification, Springer, Berlin, 1980, pp. 292\u2013332 (Lecture Notes in Computer Science, Vol. 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":"10.1016\/S0304-3975(01)00361-9_BIB2","first-page":"61","article-title":"Incompleteness of behavioural logics","volume":"Vol. 33","author":"Buss","year":"2000"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB3","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, J. Meseguer, Principles of Maude, Electronic Notes in Theoretical Computer Science, Vol. 4, Elseiver Science, Amsterdam, 1996. (Proc., 1st Internat. Workshop on Rewriting Logic and its Applications, Asilomar, CA, September 1996.)","DOI":"10.1016\/S1571-0661(04)00034-9"},{"issue":"2","key":"10.1016\/S0304-3975(01)00361-9_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1017\/S0960129596002253","article-title":"Weak inclusion systems","volume":"7","author":"C\u0103z\u0103nescu","year":"1997","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB5","unstructured":"R. Diaconescu, Category-based semantics for equational and constraint logic programming, DPhil. Thesis, University of Oxford, 1994."},{"issue":"1","key":"10.1016\/S0304-3975(01)00361-9_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S0960129500000621","article-title":"Completeness of category-based equational deduction","volume":"5","author":"Diaconescu","year":"1995","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB7","unstructured":"R. Diaconescu, Behavioural rewriting logic: semantic foundations and proof theory, October 1996, unpublished manuscript."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB8","unstructured":"R. Diaconescu, Completeness of semantic paramodulation: a category-based approach, Technical Report IS-RR-96-0006S, Japan Advanced Institute for Science and Technology, 1996."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB9","doi-asserted-by":"crossref","unstructured":"R. Diaconescu, Foundations of behavioural specification in rewriting logic, Electronic Notes in Theoretical Computer Science, Vol. 4, Elseiver Science, Amsterdam, 1996. (Proc., 1st Internat. Workshop on Rewriting Logic and its Applications. Asilomar, CA, September 1996.)","DOI":"10.1016\/S1571-0661(04)00041-6"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB10","doi-asserted-by":"crossref","unstructured":"R. Diaconescu, Extra theory morphisms for institutions: logical semantics for multi-paradigm languages, J. Appl. Categorical Struct. 6(4) (1998) 427\u2013453. (A preliminary version appeared as JAIST Technical Report IS-RR-97-0032F in 1997.)","DOI":"10.1023\/A:1008607717635"},{"issue":"3","key":"10.1016\/S0304-3975(01)00361-9_BIB11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1017\/S0960129599002960","article-title":"Category-based constraint logic","volume":"10","author":"Diaconescu","year":"2000","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB12","unstructured":"R. Diaconescu, Grothendieck institutions, IMAR Preprint 2-2000, Institute of Mathematics of the Romanian Academy, February 2000, ISSN 250\u20133638."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB13","volume":"Vol. 6","author":"Diaconescu","year":"1998"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB14","unstructured":"R. Diaconescu, K. Futatsugi, Behavioural coherence in object-oriented algebraic specification, J. Universal Comput. Sci. 6(1) (2000) 74\u201396. (First version appeared as JAIST Technical Report IS-RR-98-0017F, June 1998.)"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB15","first-page":"1644","article-title":"Component-based algebraic specification and verification in CafeOBJ","volume":"Vol. 1709","author":"Diaconescu","year":"1999"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB16","series-title":"Cafe: An Industrial-Strength Algebraic Formal Method","article-title":"CafeOBJ jewels","author":"Diaconescu","year":"2000"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB17","unstructured":"R. Diaconescu, J. Goguen, P. Stefaneas, Logical support for modularisation, in: G. Huet, G. Plotkin (Eds.), Logical Environments, Cambridge University Press, Cambridge, 1993, pp. 83\u2013130. (Proc. a Workshop held in Edinburgh, Scotland, May 1991.)"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB18","unstructured":"R. Diaconescu, P. Stefaneas, Categorical foundations of modularization for multi-paradigm languages, Technical Report IS-RR-98-0014F, Japan Advanced Institute for Science and Technology, 1998."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB19","series-title":"Proc. 12th ACM Symp. on Principles of Programming Languages","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB20","unstructured":"J. Goguen, Theorem Proving and Algebra, MIT Press, Cambridge, MA, 2002, in preparation."},{"issue":"1","key":"10.1016\/S0304-3975(01)00361-9_BIB21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/147508.147524","article-title":"Institutions","volume":"39","author":"Goguen","year":"1992","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/S0304-3975(01)00361-9_BIB22","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0960129500000517","article-title":"An Oxford survey of order sorted algebra","volume":"4","author":"Goguen","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB23","first-page":"1","article-title":"Towards an algebraic semantics for the object paradigm","volume":"Vol. 785","author":"Goguen","year":"1994"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB24","unstructured":"J. Goguen, G. Malcolm, A hidden agenda, Technical Report CS97-538, University of California at San Diego, 1997."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB25","unstructured":"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\u2013363. (An earlier version appears in J. Logic Programming, 1(2) (1984) 179\u2013210.)"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB26","unstructured":"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\u2013477. (Preliminary version in SIGPLAN Notices 21(10) (1986) 153\u2013162.)"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB27","doi-asserted-by":"crossref","unstructured":"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\u2013273. (Also, Programming Research Group Technical Monograph PRG-80, Oxford University, December 1989.)","DOI":"10.1016\/0304-3975(92)90302-V"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB28","series-title":"Current Trends in Programming Methodology, IV","first-page":"80","article-title":"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","author":"Goguen","year":"1978"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB29","series-title":"Software Engineering with OBJ: Algebraic Specification in Action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB30","doi-asserted-by":"crossref","unstructured":"A. Grothendieck, Cat\u00e9gories fibr\u00e9es et descente, in: Rev\u00eatements \u00e9tales et groupe fundamental, S\u00e9minaire de G\u00e9om\u00e9trie Alg\u00e9braique du Bois-Marie 1960\/61, Expos\u00e9 VI, Institut des Hautes \u00c9tudes Scientifiques, 1963. (Reprinted in Lecture Notes in Mathematics, Vol. 224, Springer, Berlin, 1971, pp. 145\u201394.)","DOI":"10.1007\/BFb0058662"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB31","doi-asserted-by":"crossref","unstructured":"R. Hennicker, M. Bidoit, Observational logic, in: A.M. Haeberer (Ed.), Algebraic Methodology and Software Technology, Vol. 1584, Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 263\u2013277. (Proc. AMAST\u201999.)","DOI":"10.1007\/3-540-49253-4_20"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB32","doi-asserted-by":"crossref","unstructured":"H. Hilberdink, Foundations for rewriting logic, in: K. Futatsugi (Ed.), The 3rd Internat. Workshop on Rewriting Logic and its Applications, Kanazawa, Japan, 2000.","DOI":"10.1016\/S1571-0661(05)80126-4"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB33","series-title":"Behavioral Specifications of Businesses and Systems","first-page":"103","article-title":"Component-based algebraic specification: \u2014 behavioural specification for component-based software engineering","author":"Iida","year":"1999"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB34","series-title":"Categories for the Working Mathematician","author":"MacLane","year":"1998"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB35","unstructured":"J. Meseguer, Rewriting as a unified model of concurrency, Technical Report SRI-CSL-90-02R, SRI International, Computer Science Laboratory, February 1990, Revised June 1990."},{"issue":"1","key":"10.1016\/S0304-3975(01)00361-9_BIB36","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00361-9_BIB37","first-page":"18","article-title":"Membership algebra as a logical framework for equational specification","volume":"Vol. 1376","author":"Meseguer","year":"1998"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB38","series-title":"Algebraic Methods in Semantics","first-page":"459","article-title":"Initiality, induction and computability","author":"Meseguer","year":"1985"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB39","doi-asserted-by":"crossref","unstructured":"R. Par\u00e9, D. Schumacher, Indexed Categories and their Applications, Lecture Notes in Mathematics, Vol. 661, Springer, Berlin, 1978, pp. 1\u2013125 (chapter Abstract Families and the Adjoint Functor Theorems).","DOI":"10.1007\/BFb0061361"},{"key":"10.1016\/S0304-3975(01)00361-9_BIB40","doi-asserted-by":"crossref","unstructured":"A. Tarlecki, R. Burstall, J. Goguen, Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories, Theoret. Comput. Sci. 91 (1991) 239\u2013264. (Also, Monograph PRG-77, August 1989, Programming Research Group, Oxford University.)","DOI":"10.1016\/0304-3975(91)90085-G"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003619?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003619?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T19:10:27Z","timestamp":1578424227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0304397501003619"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00361-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}