Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...