60 search results - page 9 / 12 » Recursive Definitions of Monadic Functions |
FLOPS
2008
Springer
14 years 13 days ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
POPL
2007
ACM
14 years 11 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
108
click to vote
Book
"Standard ML is a type-safe programming language that embodies many innovative ideas in programming language design. It is a statically typed language, with an extensible type...
ESOP
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
FSS
2008
13 years 11 months ago
2008
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...