290 search results - page 14 / 58 » Theorem Proving Using Lazy Proof Explication |
85
Voted
PPDP
2000
Springer
15 years 1 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
CADE
1990
Springer
15 years 1 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
IPL
2006
14 years 9 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
ICFP
1999
ACM
15 years 1 months 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...
IJCAI
2003
14 years 10 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...