2333 search results - page 174 / 467 » Recursive Computational Depth |
158
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
172
click to vote
RTA
2009
Springer
16 years 29 days ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
155
click to vote
CIE
2007
Springer
16 years 18 days ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
169
click to vote
TLCA
2007
Springer
16 years 15 days ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
142
click to vote
TLCA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...