In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...
We consider lexicM operations and their representation in a unification based lexicon and the role of lexical semantic information. We describe a unified treatment of the linguist...
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
The aim of this paper is to introduce a modelling concept and structuring principle for rule-based systems the semantics of which is not restricted to a sequential behavior, but ca...