60 search results - page 6 / 12 » Recursive Definitions of Monadic Functions |
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
ENTCS
2006
14 years 9 months ago
2006
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
ML
2008
ACM
14 years 9 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...