90 search results - page 4 / 18 » Free theorems for functional logic programs |
LPAR
2012
Springer
12 years 1 months ago
2012
Springer
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
SIAMCOMP
2008
13 years 5 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
FLOPS
2008
Springer
13 years 7 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
TPHOL
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...