Kleene monads: Handling iteration in a framework of generic effects

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

Volumn 5728 LNCS, Issue , 2009, Pages 18-33

  Goncharov, Sergey ^a   Schröder, Lutz ^a,b   Mossakowski, Till ^a,b  

^a UNIVERSITY OF BREMEN   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT PROGRAMS; ADDITIONAL CONTROL; AXIOMATISATION; COMPUTATIONAL EFFECTS; COMPUTATIONAL METALANGUAGES; EQUATIONAL THEORY; GENERIC EFFECTS; HASKELL; HORN THEORY; KLEENE ALGEBRAS; KLEENE STAR; NONDETERMINISTIC CHOICE;

ALGEBRA; COMPUTER SCIENCE; FUNCTIONAL PROGRAMMING; RECURSIVE FUNCTIONS;

COMPUTABILITY AND DECIDABILITY;

EID: 70350356172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03741-2_3     Document Type: Conference Paper

References (19)

1. Benton, P.N., Bierman, G.M., de Paiva, V.: Computational types from a logical perspective. J. Funct. Prog. 8(2), 177-193 (1998)
2. Curien, P.-L., di Cosmo, R.: A confluent reduction for the lambda-calculus with surjective pairing and terminal object. J. Funct. Program. 6(2), 299-327 (1996)
3. Fluet, M., Morrisett, G., Ahmed, A.J.: Linear regions are all you need. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 7-21. Springer, Heidelberg (2006)
4. Hinze, R.: Deriving backtracking monad transformers. ACM SIGPLAN Notices 35(9), 186-197 (2000)
5. Hyland, M., Plotkin, G.D., Power, J.: Combining effects: Sum and tensor. Theoret. Comput. Sci. 357, 70-99 (2006)
6. Jacobs, B., Poll, E.: Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci. 291, 329-349 (2003)
7. Jouannaud, J.-P., Munoz, M.: Termination of a set of rules modulo a set of equations. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol. 170, pp. 175-193. Springer, Heidelberg (1984)
8. Kiselyov, O., Shan, C., Friedman, D., Sabry, A.: Backtracking, interleaving, and terminating monad transformers. In: Functional Programming, ICFP 2005, pp. 192-203. ACM Press, New York (2005)
9. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110, 366-390 (1994)
10. Kozen, D.: Kleene algebra with tests and commutativity conditions. In: Margaria, T., Stef-fen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 14-33. Springer, Heidelberg (1996)
11. Kozen, D.: Nonlocal flow of control and Kleene algebra with tests. In: Logic in Computer Science, LICS 2008, pp. 105-117. IEEE Computer Society Press, Los Alamitos (2008)
12. Moggi, E.: Notions of computation and monads. Inf. Comput. 93, 55-92 (1991)
13. Moggi, E., Sabry, A.: Monadic encapsulation of effects: A revised approach (extended version). J. Funct. Prog. 11, 591-627 (2001)
14. Mossakowski, T., Schröder, L., Goncharov, S.: A generic complete dynamic logic for reasoning about purity and effects (Extended version to appear in Formal Aspects of Computting). In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 199-214. Springer, Heidelberg (2008)
15. Peyton Jones, S. (ed.): Haskell 98 Language and Libraries - The Revised Report. Cambridge University Press (2003);
16. J. Funct. Prog. 13 (2003)
17. Schröder, L., Mossakowski, T.: Generic exception handling and the Java monad. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 443-459. Springer, Heidelberg (2004)
18. Schröder, L., Mossakowski, T.: Monad-independent dynamic logic in HASCASL. J. Logic Comput. 14, 571-619 (2004)
19. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: Symposium on Theory of Computing, STOC 1973, pp. 1-9. ACM Press, New York (1973)