{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:35Z","timestamp":1725664295495},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:16Z","timestamp":1330278196000},"page":"242-256","source":"Crossref","is-referenced-by-count":10,"title":["Induction and recursion on datatypes"],"prefix":"10.1007","author":[{"given":"Henk","family":"Doornbos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Backhouse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"14_CR1","unstructured":"C.J. Aarts. Galois connections presented calculationally. Afstudeer verslag (Graduating Dissertation), Department of Computing Science, Eindhoven University of Technology, 1992."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"C.J. Aarts, R.C. Backhouse, P. Hoogendijk, T.S. Voermans, and J. van der Woude. A relational theory of datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub\/math.prog.construction, September 1992.","DOI":"10.1007\/3-540-57499-9_15"},{"key":"14_CR3","unstructured":"R.C. Backhouse, P. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans, and J. van der Woude. Polynomial relators. In M. Nivat, C.S. Rattray, T. Rus, and G. Scollo, editors, Proceedings of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST'91, pages 303\u2013326. Springer-Verlag, Workshops in Computing, 1992."},{"issue":"4","key":"14_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S096012950000030X","volume":"3","author":"R.C. Backhouse","year":"1993","unstructured":"R.C. Backhouse and J. van der Woude. Demonic operators and monotype factors. Mathematical Structures in Computer Science, 3(4):417\u2013433, December 1993.","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR5","unstructured":"Richard S. Bird and Oege de Moor. The algebra of programming. Programming Research Group, Oxford University. Textbook in preparation."},{"key":"14_CR6","volume-title":"volume 25 of American Mathematical Society Colloquium Publications","author":"G. Birkhoff","year":"1967","unstructured":"Garrett Birkhoff. Lattice Theory, volume 25 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, Rhode Island, 3rd edition, 1967.","edition":"3rd edition"},{"key":"14_CR7","unstructured":"B. A. Davey and H. A. Priestly. Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, first edition, 1990."},{"key":"14_CR8","volume-title":"PhD thesis","author":"M. M. Fokkinga","year":"1992","unstructured":"Maarten M. Fokkinga. Law and Order in Algorithmics. PhD thesis, Universiteit Twente, The Netherlands, 1992."},{"key":"14_CR9","unstructured":"Peter Freyd, Paul Hoogendijk, and Oege de Moor. Membership of datatypes. Unpublished draft."},{"key":"14_CR10","unstructured":"P.J. Freyd and A. Scedrov. Categories, Allegories. North-Holland, 1990."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"G. Malcolm. Homomorphisms and promotability. In J.L.A. van de Snepscheut, editor, Conference on the Mathematics of Program Construction, pages 335\u2013347. Springer-Verlag LNCS 375, 1989.","DOI":"10.1007\/3-540-51305-1_20"},{"issue":"3","key":"14_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(94)00195-5","volume":"53","author":"Eindhoven University of Technology Mathematics of Program Construction Group","year":"1995","unstructured":"Eindhoven University of Technology Mathematics of Program Construction Group. Fixed point calculus. Information Processing Letters, 53(3):131\u2013136, February 1995.","journal-title":"Information Processing Letters"},{"issue":"5","key":"14_CR13","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L. Meertens","year":"1992","unstructured":"L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413\u2013424, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"E. Meijer, M.M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA91: Functional Programming Languages and Computer Architecture, volume 523 of LNCS, pages 124\u2013144. Springer-Verlag, 1991.","DOI":"10.1007\/3540543961_7"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:24:58Z","timestamp":1640942698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}