Exploiting parallelism in coalgebraic logic programming

Ekaterina Komendantskaya, Martin Schmidt, Jonathan Heras

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)
    321 Downloads (Pure)


    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 languageEnglish
    Article numberENTCS18421
    Pages (from-to)121-148
    Number of pages28
    JournalElectronic Notes in Theoretical Computer Science
    Publication statusPublished - 28 Mar 2014


    • Coinduction
    • Corecursion
    • Guardedness
    • Parallelism
    • GoLang


    Dive into the research topics of 'Exploiting parallelism in coalgebraic logic programming'. Together they form a unique fingerprint.
    • Coalgebraic derivations in logic programming

      Komendantskaya, E. & Power, J., 2011, Leibniz International Proceedings in Informatics, LIPIcs. Dagstuhl Publications, Vol. 12. p. 352-366 15 p.

      Research output: Chapter in Book/Report/Conference proceedingChapter

      13 Citations (Scopus)
    • Coalgebraic semantics for derivations in logic programming

      Komendantskaya, E. & Power, J., 2011, Algebra and Coalgebra in Computer Science: 4th International Conference, CALCO 2011, Winchester, UK, August 30 – September 2, 2011. Proceedings. Corradini, A., Klin, B. & Cirstea, C. (eds.). Berlin: Springer , p. 268-282 15 p. (Lecture notes in computer science; vol. 6859).

      Research output: Chapter in Book/Report/Conference proceedingConference contribution

      18 Citations (Scopus)

    Cite this