38 search results - page 3 / 8 » lics 2007 |
LICS
2007
IEEE
14 years 15 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...
LICS
2007
IEEE
14 years 15 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...
LICS
2007
IEEE
14 years 15 days ago
2007
IEEE
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
LICS
2007
IEEE
14 years 15 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...
LICS
2007
IEEE
14 years 15 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...