Exploiting Parallelism in Coalgebraic Logic Programming | Zendy

Ekaterina Komendantskaya | Zendy; Martín Schmidt | Zendy; Jónathan Heras | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Exploiting Parallelism in Coalgebraic Logic Programming

Author(s) -

Ekaterina Komendantskaya,

Martín Schmidt,

Jónathan Heras

Publication year - 2014

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2014.02.007

Subject(s) - programming language , computer science , parallelism (grammar) , logic programming , parallel computing , theoretical computer science , algebra over a field , mathematics , pure mathematics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research