Monad-independent Hoare logic in HASCASL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2621, Issue , 2003, Pages 261-277

  Schröder, Lutz ^a   Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; SOFTWARE ENGINEERING; SPECIFICATIONS;

FUNCTIONAL SPECIFICATION; HIGHER-ORDER LANGUAGES; HOARE CALCULI; INPUT/OUTPUT; NON DETERMINISM; PARTIAL CORRECTNESS; S-ALGORITHMS; STATE MONADS;

FUNCTIONAL PROGRAMMING;

EID: 21144433478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36578-8_19     Document Type: Article

References (15)

1. K. Claessen and J. Hughes, Testing monadic code with QuickCheck, Haskell Workshop, ACM, 2002, pp. 65-77.
2. CoFI, The Common Framework Initiative for algebraic specification and development, electronic archives, http://www.brics.dk/Projects/CoFI.
3. CoFI Language Design Task Group, CASL - The CoFI Algebraic Specification Language - Summary, version 1.0, Documents/CASL/Summary, in [2], July 1999.
4. E. W. Dijkstra, A discipline of programming, Prentice Hall, 1976.
5. J.-C. Filliâtre, Proof of imperative programs in type theory, Types for Proofs and Programs, LNCS, vol. 1657, Springer, 1999, pp. 78-92.
6. R. Goldblatt, Logics of time and computation, CSLI, 1992.
7. The Haskell mailing list, http://www.haskell.org/mailinglist.html, May 2002.
8. 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.
9. C. Lüth and N. Ghani, Monads and modularity, Frontiers of Combining Systems, LNAI, vol. 2309, Springer, 2002, pp. 18-32.
10. S. Mac Lane, Categories for the working mathematician, Springer, 1997.
11. E. Moggi, Notions of computation and monads, Inform. and Comput. 93 (1991), 55-92.
12. P. D. Mosses, CASL: A guided tour of its design, Workshop on Abstract Datatypes, LNCS, vol. 1589, Springer, 1999, pp. 216-240.
13. F. Regensburger, HOLCF: Higher order logic of computable functions, Theorem Proving in Higher Order Logics, LNCS, vol. 971, 1995, pp. 293-307.
14. L. Schröder and T. Mossakowski, HASCASL: Towards integrated specification and development of Haskell programs, Algebraic Methodology and Software Technology, LNCS, vol. 2422, Springer, 2002, pp. 99-116.
15. Philip Wadler, How to declare an imperative, ACM Computing Surveys 29 (1997), 240-263.