8766 search results - page 442 / 1754 » Functional logic programming |
136
click to vote
JUCS
2006
15 years 3 months ago
2006
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
125
click to vote
TACS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
114
click to vote
CSR
2006
Springer
15 years 7 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 ...
128
click to vote
ECCC
2010
15 years 3 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...
127
Voted
AML
2005
15 years 3 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...