661 search results - page 2 / 133 » Argument Reduction by Factoring |
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...
ACL
2010
13 years 4 months ago
2010
In predicate-argument structure analysis, it is important to capture non-local dependencies among arguments and interdependencies between the sense of a predicate and the semantic...
TCC
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
DAC
1999
ACM
13 years 10 months ago
1999
ACM
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...