1410 search results - page 86 / 282 » Proving theorems by reuse |
CSE
2009
IEEE
14 years 4 months ago
2009
IEEE
We carefully investigate humanity’s intuitive understanding of trust and extract from it fundamental properties that succinctly synthesize how trust works. From this detailed ch...
TPHOL
2006
IEEE
14 years 4 months ago
2006
IEEE
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irr...
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
ECOOP
1998
Springer
14 years 2 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...