632 search results - page 22 / 127 » Combining programming with theorem proving |
ACMMPC
2000
Springer
14 years 4 days ago
2000
Springer
Abstract. Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate...
COMBINATORICA
2004
13 years 7 months ago
2004
In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales-Jewett Theorem in which the leftmost letters of all but one of the words were required to be vari...
FSTTCS
2004
Springer
13 years 11 months ago
2004
Springer
A separation context is a client program which does not dereference internals of a module with which it interacts. We use certain "precise" relations to unambiguously des...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
IWAR
1992
13 years 9 months ago
1992
This paper reports the study of properties of the curve pairs of the Bertrand types using our automated reasoning program based on Wu's method of mechanical theorem proving fo...