12774 search results - page 204 / 2555 » A Framework for Proof Systems |
148
click to vote
APAL
2005
15 years 6 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
160
click to vote
BSL
1999
15 years 6 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
191
click to vote
JOLLI
2002
15 years 6 months ago
2002
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
193
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
170
click to vote
SCAM
2007
IEEE
16 years 26 days ago
2007
IEEE
Clones are code segments that have been created by copying-and-pasting from other code segments. Clones occur often in large software systems. It is reported that 5 to 50% of the ...