A typed foundation for directional logic programming (1992)
| Venue: | In Proc. Workshop on Extensions to Logic Programming |
| Citations: | 11 - 1 self |
BibTeX
@INPROCEEDINGS{Reddy92atyped,
author = {Uday S. Reddy},
title = {A typed foundation for directional logic programming},
booktitle = {In Proc. Workshop on Extensions to Logic Programming},
year = {1992},
pages = {199--222}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A long standing problem in logic programming is how to impose directionality on programs in a safe fashion. The benefits of directionality include freedom from explicit sequential control, the ability to reason about algorithmic properties of programs (such as termination, complexity and deadlock-freedom) and controlling concurrency. By using Girard’s linear logic, we are able to devise a type system that combines types and modes into a unified framework, and enables one to express directionality declaratively. The rich power of the type system allows outputs to be embedded in inputs and vice versa. Type checking guarantees that values have unique producers, but multiple consumers are still possible. From a theoretical point of view, this work provides a “logic programming interpretation ” of (the proofs of) linear logic, adding to the concurrency and functional programming interpretations that are already known. It also brings logic programming into the broader world of typed languages and types-as-propositions paradigm, enriching it with static scoping and higher-order features.
