632 search results - page 27 / 127 » Combining programming with theorem proving |
ICFP
1999
ACM
14 years 3 days ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
CC
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
JAIR
2011
13 years 2 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...