60 search results - page 4 / 12 » Recursive Definitions of Monadic Functions |
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...
106
click to vote
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
CATS
2006
14 years 11 months ago
2006
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
HASKELL
2008
ACM
14 years 11 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...