{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:22:44Z","timestamp":1770294164442,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540008972","type":"print"},{"value":"9783540365761","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_2","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"23-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":67,"title":["Categories of Containers"],"prefix":"10.1007","author":[{"given":"Michael","family":"Abbott","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Altenkirch","sequence":"additional","affiliation":[]},{"given":"Neil","family":"Ghani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Abbott T. Altenkirch N. Ghani and C. McBride. Derivatives of containers. URL http:\/\/www.cs.nott.ac.uk\/~txa\/. Submitted for publication, 2003.","DOI":"10.1007\/3-540-44904-3_2"},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Types for Proof and Programs,TYPES\u2019 99","author":"A. Abel","year":"2000","unstructured":"A. Abel and T. Altenkirch. A predicative strong normalisation proof for a \u03bb-calculus with interleaving inductive types. In Types for Proof and Programs,TYPES\u2019 99, volume 1956 of Lecture Notes in Computer Science, 2000."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"J. Ad\u00e1mek","year":"1979","unstructured":"J. Ad\u00e1mek and V. Koubek. Least fixed point of a functor. Journal of Computer and System Sciences, 19:163\u2013178, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"J. Ad\u00e1mek and J. Rosick\u00fd. Locally Presentable and Accessible Categories. Number 189 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511600579"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"T. Altenkirch and C. McBride. Generic programming within dependently typed programming. In IFIP Working Conference on Generic Programming, 2002.","DOI":"10.1007\/978-0-387-35672-3_1"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"F. Borceux. Handbook of Categorical Algebra 2. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511525858"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0960129500001183","volume":"5","author":"A. Carboni","year":"1995","unstructured":"A. Carboni and P. Johnstone. Connected limits, familial representability and Artin glueing. Math. Struct. in Comp. Science, 5:441\u2013459, 1995.","journal-title":"Math. Struct. in Comp. Science"},{"issue":"1\u20132","key":"2_CR8","first-page":"112","volume":"272","author":"R. Hasegawa","year":"2002","unstructured":"R. Hasegawa. Two applications of analytic functors. Theoretical Computer Science, 272(1\u20132): 112\u2013175, 2002.","journal-title":"Theoretical Computer Science"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/CBO9780511526619.004","volume-title":"Semantics and Logics of Computation","author":"Martin Hofmann","year":"1997","unstructured":"M. Hofmann. Syntax and semantics of dependent types. In A. M. Pitts and P. Dybjer, editors, Semantics and Logics of Computation, volume 14, pages 79\u2013130. Cambridge University Press, Cambridge, 1997."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0956796899003640","volume":"10","author":"P. Hoogendijk","year":"2000","unstructured":"P. Hoogendijk and O. de Moor. Container types categorically. Journal of Functional Programming, 10(2):191\u2013225, 2000.","journal-title":"Journal of Functional Programming"},{"key":"2_CR11","unstructured":"B. Jacobs. Categorical Logic and Type Theory. Number 141 in Studies in Logic and the Foundations of Mathematics. Elsevier, 1999."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0167-6423(95)00015-1","volume":"25","author":"C. B. Jay","year":"1995","unstructured":"C. B. Jay. A semantics for shape. Science of Computer Programming, 25:251\u2013283, 1995.","journal-title":"Science of Computer Programming"},{"key":"2_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-57880-3_20","volume-title":"Shapely types and shape polymorphism","author":"C. B. Jay","year":"1994","unstructured":"C. B. Jay and J. R. B. Cockett. Shapely types and shape polymorphism. In ESOP\u2019 94: 5th European Symposium on Programming, Lecture Notes in Computer Science, pages 302\u2013316. Springer-Verlag, 1994."},{"key":"2_CR14","unstructured":"P. T. Johnstone. Topos Theory. Academic Press, 1977."},{"key":"2_CR15","unstructured":"C. McBride. The derivative of a regular type is its type of one-hole contexts. URL http:\/\/www.dur.ac.uk\/c.t.mcbride\/. 2001."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S1571-0661(05)80316-0","volume":"29","author":"E. Moggi","year":"1999","unstructured":"E. Moggi, G. Bell\u00e8, and C. B. Jay. Monads, shapely functors and traversals. Electronic Notes in Theoretical Computer Science, 29, 1999.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2_CR17","unstructured":"P. Taylor. Practical Foundations of Mathematics. Cambridge University Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T12:06:07Z","timestamp":1630065967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36576-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}