{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:13:08Z","timestamp":1739337188801,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037405"},{"type":"electronic","value":"9783642037412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03741-2_27","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:20:01Z","timestamp":1252938001000},"page":"398-412","source":"Crossref","is-referenced-by-count":2,"title":["Constructor-Based Institutions"],"prefix":"10.1007","author":[{"given":"Daniel","family":"G\u0103in\u0103","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokichi","family":"Futatsugi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Ogata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579","volume-title":"Locally Presentable and Accessible Categories","author":"J. Ad\u00e1mek","year":"1994","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Notes, vol.\u00a0189. Cambridge University Press, Cambridge (1994)"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0304-3975(01)00368-1","volume":"286","author":"E. Astesiano","year":"2002","unstructured":"Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Br\u00fcckner, B., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl: the common algebraic specification language. Theor. Comput. Sci.\u00a0286(2), 153\u2013196 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2005.09.002","volume":"67","author":"M. Bidoit","year":"2006","unstructured":"Bidoit, M., Hennicker, R.: Constructor-based observational logic. J. Log. Algebr. Program.\u00a067(1-2), 3\u201351 (2006)","journal-title":"J. Log. Algebr. Program."},{"issue":"298","key":"27_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(02)00865-4","volume":"3","author":"M. Bidoit","year":"2003","unstructured":"Bidoit, M., Hennicker, R., Kurz, A.: Observational logic, constructor-based logic, and their duality. Theor. Comput. Sci.\u00a03(298), 471\u2013510 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9783112720875","volume-title":"A Model Theoretic Oriented Approach to Partial Algebras","author":"P. Burmeister","year":"1986","unstructured":"Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras. Akademie-Verlag, Berlin (1986)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11787-008-0035-1","volume":"2","author":"M. Codescu","year":"2008","unstructured":"Codescu, M., Gaina, D.: Birkhoff completeness in institutions. Logica Universalis\u00a02(2), 277\u2013309 (2008)","journal-title":"Logica Universalis"},{"issue":"3-4","key":"27_CR8","first-page":"321","volume":"55","author":"R. Diaconescu","year":"2003","unstructured":"Diaconescu, R.: Institution-independent ultraproducts. Fundamenta Informaticae\u00a055(3-4), 321\u2013348 (2003)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(01)00361-9","volume":"285","author":"R. Diaconescu","year":"2002","unstructured":"Diaconescu, R., Futatsugi, K.: Logical foundations of CafeOBJ. Theor. Comput. Sci.\u00a0285(2), 289\u2013318 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR10","unstructured":"G\u0103in\u0103, D., Futatsugi, K., Ogata, K.: Constructor-based Institutions. Technical report, Japan Advanced Institute of Science and Technology, vol. IS-RR-2009-002, pp. 1\u201319 (May 29, 2009), http:\/\/hdl.handle.net\/10119\/8177"},{"key":"27_CR11","unstructured":"G\u0103in\u0103, D., Petria, M.: Completeness by forcing (submitted)"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J.A. Goguen","year":"1992","unstructured":"Goguen, J.A., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery\u00a039(1), 95\u2013146 (1992)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S0960129500000517","volume":"4","author":"J.A. Goguen","year":"1994","unstructured":"Goguen, J.A., Diaconescu, R.: An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science\u00a04(3), 363\u2013392 (1994)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J.A. Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science\u00a0105(2), 217\u2013273 (1992)","journal-title":"Theoretical Computer Science"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Thatcher, J.W.: Initial algebra semantics. In: Annual Symposium on Switching and Automata Theory, pp. 63\u201377 (1974)","DOI":"10.1109\/SWAT.1974.13"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-17162-2_132","volume-title":"Category Theory and Computer Programming","author":"A. Tarlecki","year":"1986","unstructured":"Tarlecki, A.: Bits and pieces of the theory of institutions. In: Poign\u00e9, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol.\u00a0240, pp. 334\u2013360. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03741-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:09:26Z","timestamp":1739333366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03741-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037405","9783642037412"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03741-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}