3928 search results - page 47 / 786 » order 2006 |
164
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
164
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
150
click to vote
CADE
2006
Springer
15 years 10 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
164
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
153
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...