We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
The goal of this paper is to develop methods to handle inconsistent knowledge elicited from multiple sources. Knowledge is represented using predicates that define relationships w...