2076 search results - page 79 / 416 » Functional logic overloading |
CSR
2006
Springer
15 years 5 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
ECCC
2010
15 years 1 months ago
2010
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...
AML
2005
15 years 1 months ago
2005
This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part f...
118
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
115
click to vote
ESOP
2000
Springer
15 years 5 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...