LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant'...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
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...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as pr...