z-logo
open-access-imgOpen Access
Recursive Definitions of Monadic Functions
Author(s) -
Alexander Krauß
Publication year - 2018
Publication title -
epic series in computing
Language(s) - English
Resource type - Conference proceedings
ISSN - 2398-7340
DOI - 10.29007/1mdt
Subject(s) - monad (category theory) , hol , recursion (computer science) , computer science , functional programming , programming language , extension (predicate logic) , simple (philosophy) , domain theory , domain (mathematical analysis) , haskell , lazy evaluation , algebra over a field , theoretical computer science , mathematics , discrete mathematics , pure mathematics , functor , mathematical analysis , philosophy , epistemology
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 function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here