The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
We introduce a type system based on intervals, objects representing the time in which a block of code will execute. The type system can verify time-based properties such as when a...
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
Metaphor and analogy are perhaps the most challenging aspects of linguistic creativity for a conceptual representation to facilitate, since by their very nature they seek to stret...