Sciweavers

LICS
1997
IEEE
14 years 3 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
LICS
1997
IEEE
14 years 3 months ago
Complete Cuboidal Sets in Axiomatic Domain Theory
Marcelo P. Fiore, Gordon D. Plotkin, A. John Power
LICS
1997
IEEE
14 years 3 months ago
First-Order Logic with Two Variables and Unary Temporal Logic
Kousha Etessami, Moshe Y. Vardi, Thomas Wilke
LICS
1997
IEEE
14 years 3 months ago
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
Martín Hötzel Escardó, Thomas S...
LICS
1997
IEEE
14 years 3 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
LICS
1997
IEEE
14 years 3 months ago
A Kleene Theorem for Timed Automata
Eugene Asarin, Paul Caspi, Oded Maler
LICS
1997
IEEE
14 years 3 months ago
Bisimulation for Labelled Markov Processes
Richard Blute, Josee Desharnais, Abbas Edalat, Pra...