Projects per year
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.
|Number of pages||28|
|Journal||Electronic Notes in Theoretical Computer Science|
|Publication status||Published - 28 Mar 2014|
FingerprintDive into the research topics of 'Exploiting parallelism in coalgebraic logic programming'. Together they form a unique fingerprint.
- 1 Finished
Coalgebraic Logic Programming for Type Inference: Parallelism and Corecursion for New Generation of Programming Languages (Joint with the University of Bath)
Engineering and Physical Sciences Research Council
1/09/13 → 31/01/17
Coalgebraic derivations in logic programmingKomendantskaya, 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 proceeding › Chapter
Coalgebraic semantics for derivations in logic programmingKomendantskaya, 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 proceeding › Conference contribution