Recursive Definitions of Monadic Functions

@inproceedings{Krauss2010RecursiveDO,
  title={Recursive Definitions of Monadic Functions},
  author={Alexander Krauss},
  booktitle={PAR},
  year={2010}
}
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 convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…