{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:36:56Z","timestamp":1725557816034},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201946"},{"type":"electronic","value":"9783540451914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45191-4_3","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T18:19:15Z","timestamp":1277317155000},"page":"97-132","source":"Crossref","is-referenced-by-count":6,"title":["Chapter 3. Generic Properties of Datatypes"],"prefix":"10.1007","author":[{"given":"Roland","family":"Backhouse","sequence":"first","affiliation":[]},{"given":"Paul","family":"Hoogendijk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"303","volume-title":"Proceedings of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST 1991","author":"R.C. Backhouse","year":"1991","unstructured":"Backhouse, R.C., de Bruin, P., Hoogendijk, P., Malcolm, G., Voermans, T.S., van der Woude, J.: Polynomial relators. In: Nivat, M., Rattray, C.S., Rus, T., Scollo, G. (eds.) Proceedings of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST 1991, pp. 303\u2013326. Springer, Heidelberg (1991); Workshops in Computing (1992)"},{"key":"3_CR2","first-page":"287","volume-title":"Proceedings of the IFIP TC2\/WG2.1 Working Conference on Constructing Programs from Specifications","author":"R.C. Backhouse","year":"1991","unstructured":"Backhouse, R.C., de Bruin, P., Malcolm, G., Voermans, T.S., van der Woude, J.: Relational catamorphisms. In: M\u00f6ller, B. (ed.) Proceedings of the IFIP TC2\/WG2.1 Working Conference on Constructing Programs from Specifications, pp. 287\u2013318. Elsevier Science Publishers B.V, Amsterdam (1991)"},{"key":"3_CR3","unstructured":"Backhouse, R.C., Doornbos, H., Hoogendijk, P.: Commuting relators (September 1992), Available via World-Wide Web at \n                  \n                    http:\/\/www.cs.nott.ac.uk\/~rcb\/MPC\/papers"},{"key":"3_CR4","volume-title":"Algebra of Programming","author":"R.S. Bird","year":"1996","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. Prentice-Hall International, Englewood Cliffs (1996)"},{"key":"3_CR5","volume-title":"Categories, Allegories","author":"P.J. Freyd","year":"1990","unstructured":"Freyd, P.J., \u0160\u010dedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0026992","volume-title":"Category Theory and Computer Science","author":"P. Hoogendijk","year":"1997","unstructured":"Hoogendijk, P., Backhouse, R.: When do datatypes commute? In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol.\u00a01290, pp. 242\u2013260. Springer, Heidelberg (1997)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0956796899003640","volume":"10","author":"P. Hoogendijk","year":"2000","unstructured":"Hoogendijk, P., de Moor, O.: Container types categorically. Journal of Functional Programming\u00a010(2), 191\u2013225 (2000)","journal-title":"Journal of Functional Programming"},{"key":"3_CR8","unstructured":"Hoogendijk, P.: A Generic Theory of Datatypes. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1997)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1977","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comp. Syst. Scs.\u00a017, 348\u2013375 (1977)","journal-title":"J. Comp. Syst. Scs."},{"key":"3_CR10","unstructured":"Milner, R.: The standard ML core language. Polymorphism\u00a0II(2) (October 1985)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093(1), 55\u201392 (1991)","journal-title":"Information and Computation"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.24033\/bsmf.1401","volume":"76","author":"J. Riguet","year":"1948","unstructured":"Riguet, J.: Relations binaires, fermetures, correspondances de Galois. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France\u00a076, 114\u2013155 (1948)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"key":"3_CR13","unstructured":"Strachey, C.: Fundamental concepts in programming languages. Lecture Notes, International Summer School in Computer Programming, Copenhagen (August 1967)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: 4\u2019th Symposium on Functional Programming Languages and Computer Architecture, ACM, London (September 1989)","DOI":"10.1145\/99370.99404"}],"container-title":["Lecture Notes in Computer Science","Generic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45191-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:40:20Z","timestamp":1552599620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45191-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201946","9783540451914"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45191-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}