Exploiting parallelism in coalgebraic logic programming

Ekaterina Komendantskaya; Martin  Schmidt; Jonathan Heras

doi:10.1016/j.entcs.2014.02.007

Exploiting parallelism in coalgebraic logic programming

Ekaterina Komendantskaya, Martin Schmidt, Jonathan Heras

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

345 Downloads (Pure)

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.

Original language	English
Article number	ENTCS18421
Pages (from-to)	121-148
Number of pages	28
Journal	Electronic Notes in Theoretical Computer Science
Volume	303
DOIs	https://doi.org/10.1016/j.entcs.2014.02.007
Publication status	Published - 28 Mar 2014

Keywords

Coinduction
Corecursion
Guardedness
Parallelism
GoLang

Access to Document

10.1016/j.entcs.2014.02.007

Author accepted manuscript
NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, [VOL 303, 28 March 2014, http://dx.doi.org/10.1016/j.entcs.2014.02.007]
Accepted author manuscript, 361 KB

Cite this

@article{78655a5c16284012b257ac45494a68cc,

title = "Exploiting parallelism in coalgebraic logic programming",

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.",

keywords = "Coinduction, Corecursion, Guardedness, Parallelism, GoLang",

author = "Ekaterina Komendantskaya and Martin Schmidt and Jonathan Heras",

year = "2014",

month = mar,

day = "28",

doi = "10.1016/j.entcs.2014.02.007",

language = "English",

volume = "303",

pages = "121--148",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

}

TY - JOUR

T1 - Exploiting parallelism in coalgebraic logic programming

AU - Komendantskaya, Ekaterina

AU - Schmidt, Martin

AU - Heras, Jonathan

PY - 2014/3/28

Y1 - 2014/3/28

N2 - 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.

AB - 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.

KW - Coinduction

KW - Corecursion

KW - Guardedness

KW - Parallelism

KW - GoLang

UR - http://www.scopus.com/inward/record.url?scp=84896482596&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2014.02.007

DO - 10.1016/j.entcs.2014.02.007

M3 - Article

AN - SCOPUS:84896482596

SN - 1571-0661

VL - 303

SP - 121

EP - 148

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

M1 - ENTCS18421

ER -

Exploiting parallelism in coalgebraic logic programming

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Coalgebraic Logic Programming for Type Inference: Parallelism and Corecursion for New Generation of Programming Languages (Joint with the University of Bath)

Coalgebraic derivations in logic programming

Coalgebraic semantics for derivations in logic programming

Cite this

Exploiting parallelism in coalgebraic logic programming

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Projects

Coalgebraic Logic Programming for Type Inference: Parallelism and Corecursion for New Generation of Programming Languages (Joint with the University of Bath)

Research output

Coalgebraic derivations in logic programming

Coalgebraic semantics for derivations in logic programming

Cite this