## Constrained partial deduction (1997)

Venue: | Proceedings of the 12th Workshop Logische Programmierung (WLP'97 |

Citations: | 3 - 0 self |

### BibTeX

@INPROCEEDINGS{Leuschel97constrainedpartial,

author = {Michael Leuschel and Danny De Schreye},

title = { Constrained partial deduction},

booktitle = {Proceedings of the 12th Workshop Logische Programmierung (WLP'97},

year = {1997},

pages = {116--126},

publisher = {}

}

### OpenURL

### Abstract

Partial deduction based upon the Lloyd and Shepherdson framework generates a specialised program given a set of atoms. Each such atom represents all its instances. This can severely limit the specialisation potential of partial deduction. We therefore extend the precision the Lloyd and Shepherdson approach by integrating ideas from constraint logic programming. We formally prove correctness of this new framework of constrained partial deduction and illustrate its potential on some examples.