Translating relational programs into Prolog

被引：0
|
作者：
Dwyer, B [1 ]
机构：
[1] Univ Adelaide, Dept Comp Sci, Adelaide, SA 5005, Australia
来源：
RELATIONAL METHODS FOR COMPUTER SCIENCE APPLICATIONS | 2001年 / 65卷
关键词：
programming languages; relational programming; programming language translators; Prolog; binary relations; higher-order relations;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The binary relation algebra has operators that correspond to well-known programming constructs. As a result, it is to possible base useful programming languages on it. An earlier paper by the author described such a language. Since Prolog predicates define relations between variables, Prolog is often considered to be a relational language. In fact, there are several straight-forward translations from relation algebra expressions to Prolog rules. This paper explores this idea in depth, showing how relation algebra can be translated into Prolog.
引用
收藏
页码：15 / 35
页数：21
相关论文
共 50 条
12345