{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:32Z","timestamp":1725795692651},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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-662-43951-7_6","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"62-73","source":"Crossref","is-referenced-by-count":6,"title":["A Coalgebraic Foundation for Coinductive Union Types"],"prefix":"10.1007","author":[{"given":"Marcello","family":"Bonsangue","sequence":"first","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Ancona","sequence":"additional","affiliation":[]},{"given":"Frank","family":"de Boer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P. Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: A coalgebraic view. Theoretical Computer Science\u00a0300(1-3), 1\u201345 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Amadio, R., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems\u00a015(4) (1993)","DOI":"10.1145\/155183.155231"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-03013-0_2","volume-title":"ECOOP 2009 \u2013 Object-Oriented Programming","author":"D. Ancona","year":"2009","unstructured":"Ancona, D., Lagorio, G.: Coinductive type systems for object-oriented languages. In: Drossopoulou, S. (ed.) ECOOP 2009. LNCS, vol.\u00a05653, pp. 2\u201326. Springer, Heidelberg (2009)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ancona, D., Lagorio, G.: Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas. In: GandALF 2010. EPTCS, vol.\u00a025 (2010)","DOI":"10.4204\/EPTCS.25.20"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ancona, D., Lagorio, G.: Complete coinductive subtyping for abstract compilation of object-oriented languages. In: FTfJP 2010. ACM Digital Library (2010)","DOI":"10.1145\/1924520.1924521"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Benzaken, V., Castagna, G., Frisch, A.: CDuce: An XML-Centric General-Purpose Language. In: ICFP (2003)","DOI":"10.1145\/944705.944711"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1016\/j.scico.2012.07.001","volume":"798","author":"M. Bonsangue","year":"2013","unstructured":"Bonsangue, M., Caltais, G., Goriac, E.-I., Lucanu, D., Rutten, J., Silva, A.: Automatic equivalence proofs for non-deterministic coalgebras. Science of Computer Programming\u00a0798(9), 1324\u20131345 (2013)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"6_CR8","first-page":"7","volume":"14","author":"M. Bonsangue","year":"2013","unstructured":"Bonsangue, M., Milius, S., Silva, A.: Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. ACM Trans. on Comp. Logic\u00a014(1), 7 (2013)","journal-title":"ACM Trans. on Comp. Logic"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundamentae Informatica\u00a033(4) (1998)","DOI":"10.1007\/3-540-62688-3_29"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C.: From Branching to Linear Time, Coalgebraically. In: FICS 2013. EPTCS, vol.\u00a0126, pp. 11\u201327 (2013)","DOI":"10.4204\/EPTCS.126.2"},{"key":"6_CR11","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/3-540-57887-0_121","volume-title":"Theoretical Aspects of Computer Software","author":"F. Damm","year":"1994","unstructured":"Damm, F.: Subtyping with Union Types, Intersection Types and Recursive Types. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 687\u2013706. Springer, Heidelberg (1994)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11417170_14","volume-title":"Typed Lambda Calculi and Applications","author":"R. Cosmo Di","year":"2005","unstructured":"Di Cosmo, R., Pottier, F., R\u00e9my, D.: Subtyping Recursive Types Modulo Associative Commutative Products. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 179\u2013193. Springer, Heidelberg (2005)"},{"issue":"2","key":"6_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jlap.2009.10.001","volume":"79","author":"Z. \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages. Journal of Logic and Algebraic Programming\u00a079(2), 189\u2013213 (2010)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Frisch, A., Castagna, G., Benzaken, V.: Semantic Subtyping: dealing set-theoretically with function, union, intersection, and negation types. The Journal of the ACM (2008)","DOI":"10.1145\/1391289.1391293"},{"issue":"6","key":"6_CR16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1017\/S0956796802004318","volume":"12","author":"V. Gapeyev","year":"2002","unstructured":"Gapeyev, V., Levin, M.Y., Pierce, B.C.: Recursive subtyping revealed. The Journal of Functional Programming\u00a012(6), 511\u2013548 (2002)","journal-title":"The Journal of Functional Programming"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: The linear time - branching time spectrum I. The semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3\u201399 (2001)","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-3(4:11)2007","volume":"3","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science\u00a03, 1\u201336 (2007)","journal-title":"Logical Methods in Computer Science"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1053468.1053470","volume":"27","author":"H. Hosoya","year":"2005","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Trans. Program. Lang. Syst.\u00a027(1), 46\u201390 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce. A statically typed XML processing language. ACM Trans. Internet Techn.\u00a03(2), 117\u2013148 (2003)","journal-title":"ACM Trans. Internet Techn."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Trace Semantics for Coalgebras. In: CMCS 2004. ENTCS, vol.\u00a0106 (2004)","DOI":"10.1016\/j.entcs.2004.02.031"},{"issue":"38","key":"6_CR22","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. Theoretical Computer Science\u00a0412(38), 5043\u20135069 (2011)","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249 (2000)","DOI":"10.1016\/S0304-3975(00)00056-6"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T08:21:11Z","timestamp":1565511671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}