Sciweavers

38 search results - page 4 / 8
» lics 2007
Sort
View
LICS
2007
IEEE
14 years 4 months ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
LICS
2007
IEEE
14 years 4 months ago
Relational Parametricity for Computational Effects
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...
Rasmus Ejlers Møgelberg, Alex Simpson
LICS
2007
IEEE
14 years 4 months ago
Pi-Calculus in Logical Form
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
Marcello M. Bonsangue, Alexander Kurz
LICS
2007
IEEE
14 years 4 months ago
Categorical Combinatorics for Innocent Strategies
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
Russell Harmer, Martin Hyland, Paul-André M...
LICS
2007
IEEE
14 years 4 months ago
Tractability and learnability arising from algebras with few subpowers
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, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...