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 …

The semantic foundations for logic programming are usually separated into two different
approaches. The operational semantics, which uses SLD-resolution, the proof method that …

In this paper we propose a type-based framework for using logic programming for XML
processing. We transform XML documents into terms and DTDs into regular types. We …

Regular types are a powerful tool for computing very precise descriptive types for logic
programs. However, in the context of real-life, modular Prolog programs, the accurate results …

Types play an important role in the verification and debugging of programming languages,
and have been the subject of significant research in the logic programming community [2, 3 …

Esta dissertaçao descreve a implementaçao dum sistema de processamento de
documentos XML (eXtensible Markup Language) em Programaçao em Lógica, que permite …

We performed an audit of the operations of the regular types library included with the Ciao
pre-processor, CiaoPP, with the objective of exploring its correctness and efficiency. We …

An algorithm to decide the emptiness of a regular type expression with set operators given a
set of parameterised type definitions is presented. The algorithm can also be used to decide …

Type systems are a powerful tool in modern programming languages. There is a lot of
previous work on typing logic programs (some examples include [20, 6, 12, 7, 19, 14, 11, 17 …

Type systems are a powerful tool in modern programming languages. Types in logic
programming are usually based on an over approximation of the program's semantics or …