We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main res...