1894 search results - page 114 / 379 » A TLA Proof System |
100
Voted
ENTCS
2008
15 years 27 days ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
86
Voted
APAL
2005
15 years 22 days 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...
96
Voted
BSL
1999
15 years 15 days 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...
114
click to vote
JOLLI
2002
15 years 15 days 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...
105
Voted
CORR
2011
Springer
14 years 4 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...