We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Emerging semantic web service description formalisms, such as OWL-S, allow for a definition of the semantic of services. Describing input and output types is not sufficient to dec...
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
We look at extensions of modal logic for representation and reasoning in the area of multi-agent systems. Building on dynamic logic and Henkin quantifiers, we study an unusual typ...