60 search results - page 1 / 12 » Recursive Definitions of Monadic Functions |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
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 opt...
ICFP
2006
ACM
14 years 4 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
SLOGICA
2008
13 years 3 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
AFP
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
JAR
2010
12 years 11 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...