How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...