Type Inferencing for Polymorphic Order-Sorted Logic Programs (1995)
| Venue: | PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING |
| Citations: | 23 - 0 self |
BibTeX
@INPROCEEDINGS{Beierle95typeinferencing,
author = {Christoph Beierle},
title = {Type Inferencing for Polymorphic Order-Sorted Logic Programs},
booktitle = {PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING},
year = {1995},
pages = {765--779},
publisher = {The MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if one does not employ the full power of the used type systems. We present a complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types.
