3710 search results - page 158 / 742 » A new calculus of contexts |
192
click to vote
CSL
2005
Springer
16 years 20 days ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
165
click to vote
CSL
2005
Springer
16 years 20 days ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
257
click to vote
AC
1992
Springer
15 years 11 months ago
1992
Springer
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
200
click to vote
ESOP
2006
Springer
15 years 10 months ago
2006
Springer
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
190
click to vote
IJCAI
1993
15 years 8 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...