Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a conve...
Main Author: | Alexander Krauss |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-12-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1012.4895v1 |
Similar Items
-
Corecursive Algebras, Corecursive Monads and Bloom Monads
by: Jiří Adámek, et al.
Published: (2014-09-01) -
Monads for behaviour
by: Piróg, M, et al.
Published: (2013) -
Of Tactics and Monads
by: Martin, A
Published: (1996) -
Monads for behaviour
by: Piróg, M, et al.
Published: (2013) -
Positive Inductive-Recursive Definitions
by: Neil Ghani, et al.
Published: (2015-03-01)