{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:17Z","timestamp":1725467417879},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634553"},{"type":"electronic","value":"9783540695523"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0026979","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T11:12:36Z","timestamp":1132398756000},"page":"34-46","source":"Crossref","is-referenced-by-count":0,"title":["Allegories as a basis for algorithmics"],"prefix":"10.1007","author":[{"given":"Richard S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"R.C. Backhouse and P.F. Hoogendijk. Elements of a relational theory of datatypes. In B. M\u00f6ller, H. Partsch, and S. Schuman, editors, Formal Program Development, volume LNCS 755, pages 7\u201342. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57499-9_15"},{"key":"2_CR2","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":"2_CR3","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":"2_CR4","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":"2_CR5","volume-title":"A relational approach to optimization problems","author":"S. Curtis","year":"1996","unstructured":"S. Curtis. A relational approach to optimization problems. DPhil. thesis, Computing Laboratory, Oxford, UK, 1996."},{"key":"2_CR6","volume-title":"Categories, Relations and Dynamic Programming","author":"O. Moor de","year":"1992","unstructured":"O. de Moor. Categories, Relations and Dynamic Programming. DPhil. thesis, Computing Laboratory, Oxford, UK, 1992. published in Mathematical Structures in Computer Science, volume 4, pp 33\u201370 (1994)."},{"key":"2_CR7","unstructured":"O. de Moor. An exercise in polytypic programming: Repmin. Programming Research Group, Oxford University, 1996."},{"key":"2_CR8","unstructured":"P. J. Freyd and A. \u0160\u010dedrov. Categories, Allegories, volume 39 of Mathematical Library. North-Holland, 1990."},{"key":"2_CR9","unstructured":"R.L. Graham, D.E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989."},{"key":"2_CR10","unstructured":"D.H. Greene and D.E. Knuth. Mathematics for the Analysis of Algorithms. Progress in Computer Science. Birkh\u00e4user, 1982."},{"key":"2_CR11","series-title":"Technical Report ECS-LFCS-87-38","volume-title":"Category theoretic approach to data types","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":"2_CR12","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 Machniery, 1995.","DOI":"10.1145\/224164.224212"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"B. Korte, L. Lovasz, and R. Schrader. Greedoids, volume 4 of Algorithms and Combinatorics. Springer-Verlag, 1991.","DOI":"10.1007\/978-3-642-58191-5"},{"key":"2_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":"2_CR15","doi-asserted-by":"crossref","unstructured":"L. Meertens. Calculate polytypically! In PLILP Conference, Lecture Notes in Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61756-6_73"},{"key":"2_CR16","volume-title":"Calculating Compilers","author":"E. Meijer","year":"1992","unstructured":"E. Meijer. Calculating Compilers. Ph.D thesis, University of Nijmegen, The Netherlands, 1992."},{"key":"2_CR17","unstructured":"C. Okasaki. Purely Functional Data Structures. Ph.D thesis, School of Computer Science, Carnegie Mellon University, 1996. *** DIRECT SUPPORT *** A0008C33 00002"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:57:41Z","timestamp":1586570261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634553","9783540695523"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0026979","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}