1410 search results - page 109 / 282 » Proving theorems by reuse |
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
CTRS
1990
14 years 2 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
TPHOL
2008
IEEE
14 years 4 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
ISTA
2004
13 years 11 months ago
2004
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
MLQ
2007
13 years 9 months ago
2007
Local sentences were introduced by Ressayre in [Res88] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for t...