3 citations · 4 across the 6 of their papers we have counts for
6 papers
MaudeTypedLog: A Typed Interpreter for Prolog in Maude
Enrique Gallifa-Tronch, João Barbosa, Santiago Escobar
Prolog is traditionally thought of as an untyped logic programming language, although there are queries that result in a type error. Several attempts of statically introducing a ty…
Regular Typed Unification
João Barbosa, Mário Florido, Vítor Santos Costa
Here we define a new unification algorithm for terms interpreted in semantic domains denoted by a subclass of regular types here called deterministic regular types. This reflects o…
Typed SLD-Resolution: Dynamic Typing for Logic Programming
João Barbosa, Mário Florido, Vítor Santos Costa
The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that comp…
Fifty Years of Prolog and Beyond
Philipp Körner, Michael Leuschel, João Barbosa +8
Both logic programming in general, and Prolog in particular, have a long and fascinating history, intermingled with that of many disciplines they inherited from or catalyzed. A lar…
Data Type Inference for Logic Programming
João Barbosa, Mário Florido, Vítor Santos Costa
In this paper we present a new static data type inference algorithm for logic programming. Without the need of declaring types for predicates, our algorithm is able to automaticall…
A Three-Valued Semantics for Typed Logic Programming
João Barbosa, Mário Florido, Vítor Santos Costa
Types in logic programming have focused on conservative approximations of program semantics by regular types, on one hand, and on type systems based on a prescriptive semantics def…