LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, inte...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
LICS
1999
IEEE
14 years 3 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...