769 search results - page 53 / 154 » Where Is the Proof |
ECOOP
2009
Springer
14 years 9 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
JSC
2008
13 years 8 months ago
2008
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
CSL
2007
Springer
14 years 3 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
PADL
2004
Springer
14 years 2 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function...