{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:31Z","timestamp":1725670051156},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_5","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"74-88","source":"Crossref","is-referenced-by-count":1,"title":["When Is a Container a Comonad?"],"prefix":"10.1007","author":[{"given":"Danel","family":"Ahman","sequence":"first","affiliation":[]},{"given":"James","family":"Chapman","sequence":"additional","affiliation":[]},{"given":"Tarmo","family":"Uustalu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M. Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers: Constructing strictly positive types. Theor. Comput. Sci.\u00a0342(1), 3\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-27764-4_2","volume-title":"Mathematics of Program Construction","author":"M. Abbott","year":"2004","unstructured":"Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: Constructing Polymorphic Programs with Quotient Types. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 2\u201315. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"5_CR3","first-page":"1","volume":"65","author":"M. Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N., McBride, C.: \u03b4 for data: Differentiating data structures. Fund. Inform.\u00a065(1-2), 1\u201328 (2005)","journal-title":"Fund. Inform."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Abbott, M.: Categories of Containers. Ph.D. thesis, University of Leicester (2003)","DOI":"10.1007\/3-540-36576-1_2"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Altenkirch, T., Morris, P.: Indexed containers. In: Proc. of 24th Ann. IEEE Symp. on Logic in Computer Science, LICS 2009, pp. 277\u2013285. IEEE CS Press (2009)","DOI":"10.1109\/LICS.2009.33"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Brookes, S., Geva, S.: Computational comonads and intensional semantics. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Applications of Categories in Computer Science, London. Math. Society Lect. Note Series, vol.\u00a077, pp. 1\u201344. Cambridge Univ. Press (1992)","DOI":"10.1017\/CBO9780511525902.003"},{"key":"5_CR7","unstructured":"Capobianco, S., Uustalu, T.: A categorical outlook on cellular automata. In: Kari, J. (ed.) Proc. of 2nd Symp. on Cellular Automata, JAC 2010. TUCS Lecture Note Series, vol.\u00a013, pp. 88\u201389. Turku Centre for Comput. Sci. (2011)"},{"issue":"1-2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(96)00145-4","volume":"176","author":"P. Dybjer","year":"1997","unstructured":"Dybjer, P.: Representing inductively defined sets by wellorderings in Martin-L\u00f6f\u2019s type theory. Theor. Comput. Sci.\u00a0176(1-2), 329\u2013335 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-24849-1_14","volume-title":"Types for Proofs and Programs","author":"N. Gambino","year":"2004","unstructured":"Gambino, N., Hyland, M.: Wellfounded Trees and Dependent Polynomial Functors. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 210\u2013225. Springer, Heidelberg (2004)"},{"key":"5_CR10","unstructured":"Gambino, N., Kock, J.: Polynomial functors and polynomial monads. Tech. Rep. 867, Centre de Recerca Matem\u00e0tica, Barcelona (2009)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","volume":"37","author":"J.Y. Girard","year":"1988","unstructured":"Girard, J.Y.: Normal functors, power series and lambda-calculus. Ann. of Pure and Appl. Logic\u00a037(2), 129\u2013177 (1988)","journal-title":"Ann. of Pure and Appl. Logic"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-540-73420-8_54","volume-title":"Automata, Languages and Programming","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Uustalu, T.: Categorical Views on Computations on Trees. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 619\u2013630. Springer, Heidelberg (2007)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G. Huet","year":"1997","unstructured":"Huet, G.: The zipper. J. of Funct. Program.\u00a07, 549\u2013554 (1997)","journal-title":"J. of Funct. Program."},{"key":"5_CR14","series-title":"Lect. Notes in Math.","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0072514","volume-title":"Combinatoire \u00e9numerative","author":"A. Joyal","year":"1987","unstructured":"Joyal, A.: Foncteurs analytiques et esp\u00e8ces de structures. In: Labelle, G., Leroux, P. (eds.) Combinatoire \u00e9numerative. Lect. Notes in Math., vol.\u00a01234, pp. 126\u2013159. Springer, Heidelberg (1987)"},{"issue":"3","key":"5_CR15","first-page":"609","volume":"2011","author":"J. Kock","year":"2011","unstructured":"Kock, J.: Polynomial functors and trees. Int. Math. Research Notices\u00a02011(3), 609\u2013673 (2011)","journal-title":"Int. Math. Research Notices"},{"issue":"1-3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0168-0072(00)00012-9","volume":"104","author":"I. Moerdijk","year":"2000","unstructured":"Moerdijk, I., Palmgren, E.: Wellfounded trees in categories. Ann. of Pure and Appl. Logic\u00a0104(1-3), 189\u2013218 (2000)","journal-title":"Ann. of Pure and Appl. Logic"},{"key":"5_CR17","unstructured":"Morris, P.: Constructing Universes for Generic Programming. Ph.D. thesis, University of Nottingham (2007)"},{"key":"5_CR18","unstructured":"Norell, U.: Towards a Practical Programming Language Based on Dependent type Theory. Ph.D. thesis, Chalmers University of Technology (2007)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-78969-7_9","volume-title":"Functional and Logic Programming","author":"R. Prince","year":"2008","unstructured":"Prince, R., Ghani, N., McBride, C.: Proving Properties about Lists using Containers. In: Garrigue, J., Hermenegildo, M. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 97\u2013112. Springer, Heidelberg (2008)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11575467_2","volume-title":"Programming Languages and Systems","author":"T. Uustalu","year":"2005","unstructured":"Uustalu, T., Vene, V.: The Essence of Dataflow Programming. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 2\u201318. Springer, Heidelberg (2005)"},{"key":"5_CR21","unstructured":"Uustalu, T., Vene, V.: Attribute evaluation is comonadic. In: van Eekelen, M. (ed.) Trends in Functional Programming, vol.\u00a06, pp. 145\u2013162. Intellect (2007)"},{"key":"#cr-split#-5_CR22.1","doi-asserted-by":"crossref","unstructured":"Uustalu, T., Vene, V.: Comonadic notions of computation. In: Ad\u00e1mek, J., Kupke, C. (eds.) Proc. of 9th Int. Wksh. on Coalgebraic Methods in Computer Science, CMCS 2008. Electron. Notes in Theor. Comput. Sci., vol.\u00a0203","DOI":"10.1016\/j.entcs.2008.05.029"},{"key":"#cr-split#-5_CR22.2","unstructured":"(5), pp. 263-284. Elsevier (2008)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:31Z","timestamp":1620126451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}