Monad-independent dynamic logic in HASCASL

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

Volumn 2755, Issue , 2003, Pages 425-441

  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;

DYNAMIC LOGIC; FUNCTIONAL SPECIFICATION; HIGHER-ORDER LANGUAGES; HOARE CALCULI; PARTIAL CORRECTNESS;

FUNCTIONAL PROGRAMMING;

EID: 0347586998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40020-2_25     Document Type: Article

References (20)

1. E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. D. Mosses, D. Sannella, and A. Tarlecki. CASL: the Common Algebraic Specification Language. Theoret. Comput. Sci., 286:153-196, 2002.
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. The Haskell mailing list, http://www.haskell.org/mailinglist.html, 2002.
5. 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.
6. J. Loeckx and K. Sieber. The Foundations of Program Verification. Wiley, 1987.
7. S. Mac Lane. Categories for the Working Mathematician. Springer, 1997.
8. E. Moggi. Notions of computation and monads. Inform. and Comput., 93:55-92, 1991.
9. E. Moggi. A semantics for evaluation logic. Fund. Inform., 22:117-152, 1995.
10. A. Pitts. Evaluation logic. In Higher Order Workshop, Workshops in Computing, pages 162-189. Springer, 1991.
11. G. Plotkin and J. Power. Notions of computation determine monads. In Foundations of Software Science and Computation Structures, volume 2303 of LNCS, pages 342-356. Springer, 2002.
12. G. Plotkin and C. Stirling. A framework for intuitionistic modal logic. In Theoretical Aspects of Reasoning about Knowledge. Morgan Kaufmann, 1986.
13. V. Pratt. Semantical considerations on Floyd-Hoare logic. In Foundations of Conputer Science, pages 109-121. IEEE, 1976.
14. F. Regensburger. HOLCF: Higher order logic of computable functions. In Theorem Proving in Higher Order Logics, volume 971 of LNCS, pages 293-307, 1995.
15. L. Schröder. Classifying categories for partial equational logic. In Category Theory and Computer Science, volume 69 of ENTCS, 2002.
16. L. Schröder and T. Mossakowski. HASCASL: Towards integrated specification and development of functional programs. In Algebraic Methodology and Software Technology, volume 2422 of LNCS, pages 99-116. Springer, 2002.
17. L. Schröder and T. Mossakowski. Monad-independent Hoare logic in HASCASL. In M. Pezze, editor, Fundamental Aspects of Software Engineering, volume 2621 of LNCS, pages 261-277, 2003.
18. D. S. Scott. Relating theories of the λ-calculus. In To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalisms, pages 403-450. Academic Press, 1980.
19. A. K. Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh, 1994.
20. Philip Wadler. How to declare an imperative. ACM Computing Surveys, 29:240-263, 1997.