{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:39Z","timestamp":1751660499346},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008996"},{"type":"electronic","value":"9783540365785"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36578-8_19","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:16:11Z","timestamp":1193454971000},"page":"261-277","source":"Crossref","is-referenced-by-count":14,"title":["Monad-Independent Hoare Logic in HASCASL"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Till","family":"Mossakowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"K. Claessen and J. Hughes, Testing monadic code with QuickCheck, HaskellWorkshop, ACM, 2002, pp. 65\u201377.","DOI":"10.1145\/581690.581696"},{"key":"19_CR2","unstructured":"CoFI, The Common Framework Initiative for algebraic specification and development, electronic archives, http:\/\/www.brics.dk\/Projects\/CoFI ."},{"key":"19_CR3","unstructured":"CoFI Language Design Task Group, Casl-The CoFI Algebraic Specification Language-Summary, version 1.0, Documents\/CASL\/Summary, in [2], July 1999."},{"key":"19_CR4","unstructured":"E. W. Dijkstra, A discipline of programming, Prentice Hall, 1976."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-48167-2_6","volume-title":"Types for Proofs and Programs","author":"J.-C. Filli\u00e2tre","year":"1999","unstructured":"J.-C. Filli\u00e2tre, Proof of imperative programs in type theory, Types for Proofs and Programs, LNCS, vol. 1657, Springer, 1999, pp. 78\u201392."},{"key":"19_CR6","unstructured":"R. Goldblatt, Logics of time and computation, CSLI, 1992."},{"key":"19_CR7","unstructured":"S. P. Jones, J. Hughes, L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler, Haskell 98: A non-strict, purely functional language, (1999), http:\/\/www.haskell.org\/onlinereport ."},{"key":"19_CR8","unstructured":"C. L\u00fcth and N. Ghani, Monads and modularity, Frontiers of Combining Systems, LNAI, vol. 2309, Springer, 2002, pp. 18\u201332."},{"key":"19_CR9","unstructured":"S. Mac Lane, Categories for the working mathematician, Springer, 1997."},{"key":"19_CR10","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, Inform. and Comput. 93 (1991), 55\u201392.","journal-title":"Inform. and Comput"},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48483-3_15","volume-title":"Casl: A guided tour of its design","author":"P. D. Mosses","year":"1999","unstructured":"P. D. Mosses, Casl: A guided tour of its design,Workshop on Abstract Datatypes, LNCS, vol. 1589, Springer, 1999, pp. 216\u2013240."},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-60275-5_72","volume-title":"Theorem Proving in Higher Order Logics","author":"F. Regensburger","year":"1995","unstructured":"F. Regensburger, HOLCF: Higher order logic of computable functions, Theorem Proving in Higher Order Logics, LNCS, vol. 971, 1995, pp. 293\u2013307."},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-45719-4_8","volume-title":"Algebraic Methodology and Software Technology","author":"L. Schr\u00f6der","year":"2002","unstructured":"L. Schr\u00f6der and T. Mossakowski, HasCasl: Towards integrated specification and development of Haskell programs, Algebraic Methodology and Software Technology, LNCS, vol. 2422, Springer, 2002, pp. 99\u2013116."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/262009.262011","volume":"29","author":"P. Wadler","year":"1997","unstructured":"Philip Wadler, How to declare an imperative, ACM Computing Surveys 29 (1997), 240\u2013263.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36578-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:07:47Z","timestamp":1556921267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36578-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008996","9783540365785"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36578-8_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}