Monad-independent dynamic logic in HasCasl

Journal of Logic and Computation

Volumn 14, Issue 4, 2004, Pages 571-619

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

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Algebraic specification; Casl; Dynamic logic; Functional programming; Monads

Indexed keywords

ALGEBRAIC SPECIFICATION; CASL; DYNAMIC LOGIC; FUNCTIONAL PROGRAMMING; MONADS;

ALGEBRA; ALGORITHMS; FORMAL LOGIC; HIGH LEVEL LANGUAGES; SEMANTICS; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 4444256022     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.4.571     Document Type: Conference Paper

References (41)

1. J. Adámek, H. Herrlich, and G. E. Strecker. Abstract and Concrete Categories. Wiley Interscience, 1990.
2. E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P. D. Mosses, D. Sannella, and A. Tarlecki. CASL: the Common Algebraic Specification Language. Theoretical Computer Science, 286, 153-196, 2002.
3. M. Barr and C. Wells. Toposes, Triples and Theories. Springer, 1984.
4. R. L. Crole. Programming Metalogics with a Fixpoint Type. PhD thesis, University of Cambridge, 1991.
5. E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
6. M. Felleisen and R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103, 235-271, 1992.
7. A. Filinski. Declarative continuations: an investigation of duality in programming language semantics. In Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, pp. 224-229. Springer, 1989.
8. C. Führmann. The Structure of Call-by-Value. PhD thesis, University of Edinburgh, 2000.
9. C. Führmann, Varieties of effects. In Foundations of Software Science and Computation Structures, volume 2303 of Lecture Notes in Computer Science, pp. 144-158. Springer, 2002.
10. R. Goldblatt. Topoi, The Categorial Analysis of Logic. North-Holland, revised edition, 1984.
11. The Haskell mailing list. http://www.haskell.org/mailinglist.html, 2002.
12. G. M. Kelly and A. J. Power. Adjunctions whose counits are coequalizers, and presentations of unitary monads. Journal of Pure and Applied Algebra, 89, 163- 179, 1993.
13. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27, 333-354, 1983.
14. D. Kozen and J. Tiuryn. Logics of programs. In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, J. van Leeuwen, ed., chapter 14, pp. 789-840. MIT Press, 1990.
15. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
16. J. Loeckx and K. Sieber. The Foundations of Program Verification. Wiley, 1987.
17. S. Mac Lane. Categories for the Working Mathematician. Springer, 1997.
18. I. Moerdijk and E. Palmgren. Wellfounded trees in categories. Annals of Pure and Applied Logic, 104, 189-218, 2000.
19. p- calculus. In Category Theory and Computer Programming, volume 240 of Lecture Notes In Computer Science, pp. 242-251. Springer, 1986.
20. E. Moggi. The Partial Lambda Calculus. PhD thesis. University of Edinburgh, 1988.
21. E. Moggi. Notions of computation and monads. Information and Computation, 93, 55-92, 1991.
22. E. Moggi. A semantics for evaluation logic. Fundamenta Informatica, 22. 117-152, 1995.
23. P. D. Mosses, editor. CASL Reference Manual, volume 2960 of Lecture Notes in Computer Science, Springer, 2004.
24. L. Paulson. Constructing recursion operators in intuitionistic type theory. Journal of Symbolic Computation. 2, 325-355, 1986.
25. S. Peyton-Jones, editor. Haskell 98 Language and Libraries - The Revised Report. Cambridge, 2003. also: Journal of Functional Programming, 13, 2003.
26. S. Peyton-Jones, editor. Haskell 98 Language and Libraries - The Revised Report. Cambridge, 2003. also: Journal of Functional Programming, 13, 2003.
27. A. Pitts. Evaluation logic. In Higher Order Workshop, Workshops in Computing, pp. 162-189. Springer. 1991.
28. G. Plotkin and J. Power. Notions of computation determine monads. In Foundations of Software Science and Computation Structures, volume 2303 of Lecture Notes in Computer Science, pp. 342-356. Springer. 2002.
29. G. Plotkin and C. Stirling. A framework for intuitionistic modal logic. In Theoretical Aspects of Reasoning about Knowledge. Morgan Kaufmann, 1986.
30. V. Pratt. Semantical considerations on Floyd-Hoare logic. In Foundations of Computer Science, pp. 109-121. IEEE, 1976.
31. F. Regensburger. HOLCF: Higher order logic of computable functions. In Theorem Proving in Higher Order Logics, volume 971 of Lecture Notes in Computer Science, pp. 293-307, 1995.
32. L. Schröder. The HASCASL prologue: categorical syntax and semantics of the partial λ-calculus. Available at http://www.informatik.uni-bremen. de/~lschrode/hascasl/plam.ps
33. L. Schröder. Classifying categories for partial equational logic. In Category Theory and Computer Science, volume 69 of Electronic Notes of Theoretical and Computational Science, Elsevier, 2002.
34. L. Schröder. Henkin models of the partial λ-calculus. In Computer Science Logic, volume 2803 of Lecture Notes in Computer Science, pp. 498-512. Springer, 2003.
35. L. Schröder and T. Mossakowski. HASCASL: Towards integrated specification and development of functional programs. In Algebraic Methodology and Software Technology, volume 2422 of Lecture Notes in Computer Science, pp. 99-116. Springer, 2002.
36. L. Schröder and T. Mossakowski. Monad-independent dynamic logic in HASCASL. In Recent Developments in Algebraic Development Techniques, 16th International Workshop, WADT02, volume 2755 of Lecture Notes in Computer Science, pp. 425-441. Springer. 2003.
37. L. Schröder and T. Mossakowski. Monad-independent Hoare logic in HASCASL. In Fundamental Aspects of Software Engineering, M. Pezze, ed., volume 2621 of Lecture Notes in Computer Science, pp. 261-277, 2003.
38. L. Schröder, T. Mossakowski, and C. Maeder. HASCASL - Integrated functional specification and programming. Language summary. Available at http://www.informatik.uni-bremen.de/agbkb/forschung/formal_methods/CoFI/HasCASL
39. A. K. Simpson. The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis. University of Edinburgh, 1994.
40. H. Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.
41. P. Wadler. How to declare an imperative. ACM Computing Surveys, 29, 240-263, 1997.