{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:05Z","timestamp":1780994705828,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645917","type":"print"},{"value":"9783540693451","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054285","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:32Z","timestamp":1149665312000},"page":"52-67","source":"Crossref","is-referenced-by-count":73,"title":["Nested datatypes"],"prefix":"10.1007","author":[{"given":"Richard","family":"Bird","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lambert","family":"Meertens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"R. Bird and O. de Moor. Algebra of Programming. International Series in Computing Science. Prentice Hall, 1996.","DOI":"10.1007\/978-3-642-61455-2_12"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796800001556","volume":"6","author":"R. S. Bird","year":"1996","unstructured":"R. S. Bird, P. F. Hoogendijk, and O. De Moor. Generic programming with relations and functors. Journal of Functional Programming, 6(1):1\u201328, 1996.","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S0960129500000803","volume":"5","author":"R.H. Connelly","year":"1995","unstructured":"R.H. Connelly and F. Lockwood Morris. A generalisation of the trie data structure. Mathematical Structures in Computer Science, 5(3):381\u2013418, 1995.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR4","unstructured":"Oege de Moor and Paul Hoogendijk. What is a datatype? Technical Report 96\/16, Department of Maths and Computing Science, Eindhoven University of Technology, 1996."},{"key":"6_CR5","unstructured":"Paul Hoogendijk. A Generic theory of Data Types. Ph.D Thesis, Eindhoven University of Technology, 1997."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"L. Fegaras and T. Sheard. Revisiting catamorphisms over datatypes with embedded functions. In 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Association for Computing Machinery, 1996.","DOI":"10.1145\/237721.237792"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0084215","volume":"1488","author":"P. Freyd","year":"1990","unstructured":"Peter Freyd. Algebraically complete categories. Springer-Verlag Lecture Notes in Mathematics, vol 1488, 95\u2013104, 1990.","journal-title":"Springer-Verlag Lecture Notes in Mathematics"},{"key":"6_CR8","series-title":"Technical Report ECS-LFCS-87-38","volume-title":"PhD thesis","author":"T. Hagino","year":"1987","unstructured":"T. Hagino. Category theoretic approach to data types. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, UK, 1987. Technical Report ECS-LFCS-87-38."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"J. Jeuring. Polytypic pattern matching. In S. Peyton Jones, editor, Functional Programming and Computer Architecture, pages 238\u2013248. Association for Computing Machinery, 1995.","DOI":"10.1145\/224164.224212"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103:151\u2013161, 1968.","journal-title":"Mathematische Zeitschrift"},{"key":"6_CR11","unstructured":"Saunders Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer-Verlag, 1971."},{"issue":"2\u20133","key":"6_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G. Malcolm","year":"1990","unstructured":"G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14(2\u20133):255\u2013279, 1990.","journal-title":"Science of Computer Programming"},{"key":"6_CR13","volume-title":"Ph.D thesis","author":"G. Malcolm","year":"1990","unstructured":"G. Malcolm. Algebraic Data Types and Program Transformation. Ph.D thesis, University of Groningen, The Netherlands, 1990."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computing Science. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lambert Meertens. Calculate polytypically! In Herbert Kuchen and S. Doaitse Swierstra, editors, Programming Languages: Implementations Logics, and Programs Proceedings Eighth International Symposium PLILP '96, volume 1140 of LNCS, pages 1\u201316. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61756-6_73"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"E. Meijer and G. Hutton. Bananas in space: extending fold and unfold to exponential types. In S. Peyton Jones, editor, Functional Progamming Languages and Computer Architecture, pages 324\u2013333. Association for Computing Machinery, 1995.","DOI":"10.1145\/224164.224225"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"A. Mycroft. Polymorphic type schemes and recursive definitions. In International Symposium on Programming, volume LNCS 167, pages 217\u2013228. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-12925-1_41"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"C. Okasaki. Purely Functional Data Structures. Ph.D thesis, School of Computer Science, Carnegie Mellon University, 1996.","DOI":"10.1007\/3-540-61628-4_5"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"C. Okasaki. Catenable double-ended queues. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), pages 66\u201374. ACM, 1997.","DOI":"10.1145\/258948.258956"},{"key":"6_CR20","unstructured":"S. Peyton Jones and J. Launchbury. Explicit quantification in Haskell. See: http:\/\/www.dcs.gla.ac.uk\/people\/personal\/simonpj\/."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T17:06:45Z","timestamp":1683479205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645917","9783540693451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0054285","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}