A Hoare-style programming logic for the sequential kernel of Java is presented. It handles
recursive methods, class and interface types, subtyping, inheritance, dynamic and static …

This paper presents a new closure conversion algorithm for simply-typed languages. We
have have implemented the algorithm as part of MLton, a whole-program compiler for …

Set-based program analysis has many potential applications, including compiler
optimisations, type-checking, debugging, verification and planning. One method of set …

There are two kinds of approaches for termination analysis of logic programs:“
transformational” and “direct” ones. Direct approaches prove termination directly on the …

We introduce a new class of finite automata. They are usual bottom-up tree automata that
run on DAG representations of finite trees. We prove that the emptiness problem for this …

In this paper we present a new static data type inference algorithm for logic programming.
Without the need for declaring types for predicates, our algorithm is able to automatically …

This paper demonstrates how a higher-level, declarative view of XML parsing as folding
over XML documents has helped to design and implement a better XML parser. By better we …

In logic programming, almost no work has been done so far on proving that certain queries
cannot succeed. Work in this direction could be useful for queries which seem to be non …

Set-based analysis of logic programs provides an accurate method for descriptive type-
checking of logic programs. The key idea of this method is to upper approximate the least …

This paper introduces a framework of parametric descriptive directional types for Constraint
Logic Programming (CLP). It proposes a method for locating type errors in CLP programs …