LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andr
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
LICS
1999
IEEE
13 years 9 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
13 years 9 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
13 years 9 months ago
1999
IEEE
LICS
1999
IEEE
13 years 9 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
13 years 9 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
13 years 9 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...