We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
Very recently, a (fuzzy modal) logic to reason about coherent conditional probability, in the sense of de Finetti, has been introduced by the authors. Under this approach, a condi...
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...