Exploiting Parallelism in Coalgebraic Logic Programming

被引：4
|
作者：
Komendantskaya, Ekaterina [1 ]
Schmidt, Martin [2 ]
Heras, Jonathan [1 ]
机构：
[1] Univ Dundee, Sch Comp, Dundee, Scotland
[2] Univ Osnabruck, Inst Cognit Sci, Osnabruck, Germany
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2014年 / 303卷 / 303期
基金：
英国工程与自然科学研究理事会;
关键词：
Coinduction; Corecursion; Guardedness; Parallelism; GoLang;
D O I：
10.1016/j.entcs.2014.02.007
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both corecursion and parallelism. Here, we discuss how the coalgebraic semantics influenced our parallel implementation of logic programming.
引用
收藏
页码：121 / 148
页数：28
相关论文
共 50 条
12345