Skip to main content
Journal ArticleOPEN ACCESS

Exploiting parallelism in coalgebraic logic programming

Electronic Notes in Theoretical Computer Science (2014) 303 121-148
DOI: 10.1016/j.entcs.2014.02.007
4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2014 Elsevier B.V.

Author supplied keywords

Cite

CITATION STYLE

APA

Komendantskaya, E., Schmidt, M., & Heras, J. (2014). Exploiting parallelism in coalgebraic logic programming. Electronic Notes in Theoretical Computer Science, 303, 121–148. https://doi.org/10.1016/j.entcs.2014.02.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free