12774 search results - page 202 / 2555 » A Framework for Proof Systems |
157
click to vote
SMI
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper, we present a controllable, fast and efficient particle system framework for skeletal implicit surfaces defined by the BlobTree model. We propose efficient algori...
303
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
146
click to vote
FMCAD
2007
Springer
16 years 22 days ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
189
click to vote
LFCS
2007
Springer
16 years 21 days ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
152
click to vote
SAC
2006
ACM
16 years 16 days ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...