4 papers
A Backward Analysis for Constraint Logic Programs
Andy King, Lunjin Lu
One recurring problem in program development is that of understanding how to re-use code developed by a third party. In the context of (constraint) logic programming, part of this…
An Emptiness Algorithm for Regular Types with Set Operators
Lunjin Lu, John G. Cleary
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 d…
A Polymorphic Groundness Analysis of Logic Programs
Lunjin Lu
A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analy…
On Dart-Zobel Algorithm for Testing Regular Type Inclusion
Lunjin Lu, John G. Cleary
This paper answers open questions about the correctness and the completeness of Dart-Zobel algorithm for testing the inclusion relation between two regular types. We show that the…