We describe an editor geared to recursive Prolog procedures. It is similar to the structure editors built for many programming languages, except that instead of just ensuring the correctness of the syntax of the procedures built by the editor, the editor also ensures the correct use of recursion. By correct here we mean that the recursive procedure is guaranteed to terminate and to be well-defined. Within these constraints we have tried to ensure that the range of procedures that can be built is as complete as possible
Refactoring is an established technique from the OO-community to restructure code: it aims at improv...
The paper presents an analyzer for verifying the correctness of a Prolog program relative to a speci...
Derivation of logic programs from first-order logic specifications is nontrivial and tends to be don...
The software crisis for procedural languages was precipitated by the failure of the prevailing adhoc...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
We present a method of extracting the programming techniques employed in Prolog programs. Techniques...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
In an earlier paper, we described a method for synthesising recursive logic procedures from their fi...
In this paper we present several extensions to support a more declarative view of programming in Pro...
An approach to Prolog programming based on patterns is presented. Two classes of patterns are identi...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
Co-recursion is the ability of defining a function that produces some infinite data in terms of the ...
An implementation technique for abstract imterpretation is given which exploits stream communication...
Refactoring is an established technique from the OO-community to restructure code: it aims at improv...
The paper presents an analyzer for verifying the correctness of a Prolog program relative to a speci...
Derivation of logic programs from first-order logic specifications is nontrivial and tends to be don...
The software crisis for procedural languages was precipitated by the failure of the prevailing adhoc...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
We present a method of extracting the programming techniques employed in Prolog programs. Techniques...
Introduction. The organization of branches and repetitions in the context of logical programming is ...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
In an earlier paper, we described a method for synthesising recursive logic procedures from their fi...
In this paper we present several extensions to support a more declarative view of programming in Pro...
An approach to Prolog programming based on patterns is presented. Two classes of patterns are identi...
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control....
Co-recursion is the ability of defining a function that produces some infinite data in terms of the ...
An implementation technique for abstract imterpretation is given which exploits stream communication...
Refactoring is an established technique from the OO-community to restructure code: it aims at improv...
The paper presents an analyzer for verifying the correctness of a Prolog program relative to a speci...
Derivation of logic programs from first-order logic specifications is nontrivial and tends to be don...