54 search results - page 6 / 11 » Extracting Algorithms from Intuitionistic Proofs |
KBSE
1999
IEEE
13 years 11 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
ENTCS
2008
13 years 7 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
HOA
1995
13 years 11 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...