LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
LICS
1995
IEEE
14 years 3 months ago
1995
IEEE
LICS
1997
IEEE
14 years 3 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
LICS
1997
IEEE
14 years 3 months ago
1997
IEEE
We present a game-theoretic model of the polymorphic -calculus, system F, as a fibred category. Every morphism of the model defines an -expanded, -normal form ^ of system F whose...
LICS
1997
IEEE
14 years 3 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
LICS
1997
IEEE
14 years 3 months ago
1997
IEEE