We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...