4573 search results - page 679 / 915 » Automated Reasoning |
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
114
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is...
106
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
132
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
108
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...