13383 search results - page 159 / 2677 » Abstractions from proofs |
147
click to vote
CADE
1990
Springer
15 years 10 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...
183
click to vote
LOPSTR
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
150
click to vote
CCCG
2008
15 years 8 months ago
2008
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
147
click to vote
APAL
2005
15 years 6 months ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
164
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...