Sciweavers

24 search results - page 4 / 5
» lics 1999
Sort
View
LICS
1999
IEEE
13 years 9 months ago
Some Decision Problems of Enormous Complexity
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...
Harvey Friedman
LICS
1999
IEEE
13 years 9 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
LICS
1999
IEEE
13 years 9 months ago
Subtyping Recursive Types in Kernel Fun
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...
Dario Colazzo, Giorgio Ghelli
LICS
1999
IEEE
13 years 9 months ago
A Superposition Decision Procedure for the Guarded Fragment with Equality
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 ...
Harald Ganzinger, Hans de Nivelle
LICS
1999
IEEE
13 years 9 months ago
Abstract Syntax and Variable Binding
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...
Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi