{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:03:05Z","timestamp":1746244985543,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642547881"},{"type":"electronic","value":"9783642547898"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-54789-8_12","type":"book-chapter","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T09:58:44Z","timestamp":1396519124000},"page":"211-234","source":"Crossref","is-referenced-by-count":1,"title":["Initial Algebras of Terms with Binding and Algebraic Structure"],"prefix":"10.1007","author":[{"given":"Bart","family":"Jacobs","sequence":"first","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-19805-2_6","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Atkey","year":"2011","unstructured":"Atkey, R., Johann, P., Ghani, N.: When is a type refinement an inductive type? In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 72\u201387. Springer, Heidelberg (2011)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985), Revized and corrected version available from www.cwru.edu\/artsci\/math\/wells\/pub\/ttt.html","DOI":"10.1007\/978-1-4899-0021-0"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bonsangue, M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. on Computational Logic\u00a014(1) (2013)","DOI":"10.1145\/2422085.2422092"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics, vol.\u00a050, 51 and 52. Cambridge Univ. Press (1994)","DOI":"10.1017\/CBO9780511525858"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Coecke, B., Pavlovi\u0107, D., Vicary, J.: A new description of orthogonal bases. Math. Struct. in Comp. Sci., 1\u201313 (2012)","DOI":"10.1017\/S0960129512000047"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1995.1145","volume":"122","author":"U. Liguoro de\u2019","year":"1995","unstructured":"de\u2019 Liguoro, U., Piperno, A.: Non-deterministic extensions of untyped \u03bb-calculus. Inf. & Comp.\u00a0122, 149\u2013177 (1995)","journal-title":"Inf. & Comp."},{"key":"12_CR7","unstructured":"\u00c9sik, Z., Kuich, W.: Free iterative and iteration k-semialgebras. CoRR, abs\/1008.1507 (2010)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: LICS, pp. 193\u2013202. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782615"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.ic.2005.08.004","volume":"2004","author":"M. Fiore","year":"2006","unstructured":"Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. Inf. & Comp.\u00a02004(4), 524\u2013560 (2006)","journal-title":"Inf. & Comp."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Fiore, M., Turi, D.: Semantics of name and value passing. In: Logic in Computer Science, pp. 93\u2013104. IEEE Computer Science Press (2001)","DOI":"10.1109\/LICS.2001.932486"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Goguen, J., Thatcher, J., Wagner, E., Wright, J.: Initial algebra semantics and continuous algebras. Journ. ACM\u00a024(1), 68\u201395 (1977)","journal-title":"Journ. ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace theory via coinduction. Logical Methods in Computer Science\u00a03(4:11) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(94)90020-5","volume":"69","author":"B. Jacobs","year":"1994","unstructured":"Jacobs, B.: Semantics of weakening and contraction. Ann. Pure & Appl. Logic\u00a069(1), 73\u2013106 (1994)","journal-title":"Ann. Pure & Appl. Logic"},{"key":"12_CR14","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11780274_20","volume-title":"Algebra, Meaning, and Computation","author":"B. Jacobs","year":"2006","unstructured":"Jacobs, B.: A bialgebraic review of deterministic automata, regular expressions and languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 375\u2013404. Springer, Heidelberg (2006)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-22944-2_17","volume-title":"Algebra and Coalgebra in Computer Science","author":"B. Jacobs","year":"2011","unstructured":"Jacobs, B.: Bases as coalgebras. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 237\u2013252. Springer, Heidelberg (2011)"},{"key":"12_CR17","unstructured":"Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observations (2012) Book, in preparation; version 2 available from http:\/\/www.cs.ru.nl\/B.Jacobs\/CLG\/JacobsCoalgebraIntro.pdf"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Joyal, A., Moerdijk, I.: Algebraic Set Theory. LMS, vol.\u00a0220. Cambridge Univ. Press (1995)","DOI":"10.1017\/CBO9780511752483"},{"issue":"38","key":"12_CR19","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B. Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: An introduction. Theor. Comp. Sci.\u00a0412(38), 5043\u20135069 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7146\/math.scand.a-11042","volume":"29","author":"A. Kock","year":"1971","unstructured":"Kock, A.: Bilinearity and cartesian closed monads. Math. Scand.\u00a029, 161\u2013174 (1971)","journal-title":"Math. Scand."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1017\/S1446788700010272","volume":"XII","author":"A. Kock","year":"1971","unstructured":"Kock, A.: Closed categories generated by commutative monads. Journ. Austr. Math. Soc\u00a0XII, 405\u2013424 (1971)","journal-title":"Journ. Austr. Math. Soc"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"Lambek, J.: A fixed point theorem for complete categories. Math. Zeitschr.\u00a0103, 151\u2013161 (1968)","journal-title":"Math. Zeitschr."},{"key":"12_CR23","unstructured":"Manes, E.G.: Algebraic Theories. Springer, Berlin (1974)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Berlin (1971)","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-22944-2_21","volume-title":"Algebra and Coalgebra in Computer Science","author":"R.E. M\u00f8gelberg","year":"2011","unstructured":"M\u00f8gelberg, R.E., Staton, S.: Linearly-used state in models of call-by-value. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol.\u00a06859, pp. 298\u2013313. Springer, Heidelberg (2011)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-12032-9_25","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Pagani","year":"2010","unstructured":"Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 358\u2013373. Springer, Heidelberg (2010)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/3-540-58027-1_25","volume-title":"Mathematical Foundations of Programming Semantics","author":"A.M. Rabinovich","year":"1994","unstructured":"Rabinovich, A.M.: A complete axiomatisation for trace congruence of finite state behaviors. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 530\u2013543. Springer, Heidelberg (1994)"},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR29","unstructured":"Silva, A.: Kleene coalgebra. PhD thesis, Radboud University Nijmegen (2010)"},{"key":"12_CR30","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: Proc. FSTTCS 2010. LIPIcs, vol.\u00a08, pp. 272\u2013283 (2010)"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonsangue, M., Rutten, J.: Non-deterministic kleene coalgebras. Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:23)2010"},{"issue":"3","key":"12_CR32","first-page":"366","volume":"8","author":"T. Uustalu","year":"2001","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic Journ. Comput.\u00a08(3), 366\u2013390 (2001)","journal-title":"Nordic Journ. Comput."}],"container-title":["Lecture Notes in Computer Science","Categories and Types in Logic, Language, and Physics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54789-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:21:08Z","timestamp":1746170468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54789-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547881","9783642547898"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54789-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}