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...
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...
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...
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 ...
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...