11345 search results - page 1674 / 2269 » Foundations of Computer Science |
120
click to vote
LICS
2007
IEEE
16 years 22 days 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, ....
144
click to vote
LICS
2007
IEEE
16 years 22 days 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...
167
click to vote
LICS
2007
IEEE
16 years 22 days 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...
142
click to vote
LICS
2007
IEEE
16 years 22 days 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...
170
click to vote
LICS
2007
IEEE
16 years 22 days ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...