{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:02:18Z","timestamp":1743109338401,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645917"},{"type":"electronic","value":"9783540693451"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054296","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:32Z","timestamp":1149665312000},"page":"286-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Beyond fun: Order and membership in polytypic imperative programming"],"prefix":"10.1007","author":[{"given":"David A.","family":"Naumann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"R. Bird and O. de Moor. Algebra of Programming. Prentice-Hall, 1996.","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"17_CR2","unstructured":"R. Cockett and D. Spencer. Strong categorical datatypes I. In R. A. G. Seely, editor, International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings. AMS, 1992."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(92)90001-C","volume":"43","author":"O. de Moor","year":"1992","unstructured":"O. de Moor. Inductive data types for predicate transformers. Inf. Process. Lett., 43(3):113\u2013118, 1992.","journal-title":"Inf. Process. Lett."},{"key":"17_CR4","unstructured":"O. de Moor. An exercise in polytypic programming: repmin. Typescript, www.comlab.ox.ac.uk\/oucl\/publications\/books\/algebra\/papers\/repmin.ps.gz,, Sept. 1996."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(94)00211-Z","volume":"150","author":"P. Gardiner","year":"1995","unstructured":"P. Gardiner. Algebraic proofs of consistency and completeness. Theoretical Cornput. Sci., 150:161\u2013191, 1995.","journal-title":"Theoretical Cornput. Sci."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-6423(94)90006-X","volume":"22","author":"P. H. Gardiner","year":"1994","unstructured":"P. H. Gardiner, C. E. Martin, and O. de Moor. An algebraic construction of predicate transformers. Science of Computer Programming, 22:21\u201344, 1994.","journal-title":"Science of Computer Programming"},{"key":"17_CR7","unstructured":"P. Hoogendijk. A generic theory of data types. Dissertation, Technische Universiteit Eindhoven, 1997."},{"key":"17_CR8","unstructured":"P. Hoogendijk and O. de Moor. What is a data type? Technical Report 96\/16, Eindhoven University of Technology, 1996. www.win.tue.nl\/win\/cs\/wp\/papers."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"P. Jansson and J. Jeuring. PolyP \u2014 a polytypic programming language extension. In Proceedings, Principles of Programming Languages, pages 470\u201382. ACM Press, 1997.","DOI":"10.1145\/263699.263763"},{"key":"17_CR10","first-page":"489","volume":"969","author":"C. Martin","year":"1995","unstructured":"C. Martin. Towards a calculus of predicate transformers. In Proceedings, Mathematical Foundations of Computer Science, volume 969 of Springer LNCS, pages 489\u201349, 1995.","journal-title":"Springer LNCS"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/S0960129500001262","volume":"1","author":"C. Martin","year":"1991","unstructured":"C. Martin, C. Hoare, and J. He. Pre-adjunctions in order enriched categories. Mathematical Structures in Computer Science, 1:141\u2013158, 1991.","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"key":"17_CR13","unstructured":"C. Morgan. Programming from Specifications, second edition. Prentice Hall, 1994."},{"key":"17_CR14","unstructured":"D. A. Naumann. Predicate transformer semantics of an Oberon-like language. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, IFIP Transactions A-56. Elsevier, 1994."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0020-0190(94)00049-2","volume":"50","author":"D. A. Naumann","year":"1994","unstructured":"D. A. Naumann. A recursion theorem for predicate transformers on inductive data types. Inf. Process. Lett., 50:329\u2013336, 1994.","journal-title":"Inf. Process. Lett."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(94)00247-G","volume":"150","author":"D. A. Naumann","year":"1995","unstructured":"D. A. Naumann. Predicate transformers and higher order programs. Theoretical Comput. Sci., 150:111\u2013159, 1995.","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR17","unstructured":"D. A. Naumann. A categorical model for higher order imperative programming. Mathematical Structures in Computer Science, 1996. To appear."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"D. A. Naumann. Towards squiggly refinement algebra. In W.-P. de Roever and D. Gries, eds., IFIP Working Conference on Programming Concepts and Methods. Chapman and Hall, 1998.","DOI":"10.1007\/978-0-387-35358-6_23"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J. Power","year":"1997","unstructured":"J. Power and E. Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7:453\u2013468, 1997.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:03:37Z","timestamp":1674072217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645917","9783540693451"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0054296","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}