Output details
11 - Computer Science and Informatics
University of Dundee
Return to search
Output 0 of 0 in the submission
Output title
Coalgebraic derivations in logic programming
Type
E - Conference contribution
Name of conference/published proceedings
Leibniz International Proceedings in Informatics, LIPIcs
Volume number
-
Issue number
-
First page of article
352
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
1
Additional information
<11> The paper contains the most significant outcomes of 6 years of collaboration between Komendantskaya and Power – the new algorithm of coalgebraic resolution for Logic Programming, together with all necessary theorems of its soundness, completeness, and adequacy relative to the coalgebraic semantics. The significance of the results for implementation of corecursion and parallelism in modern programming languages and compilers was recognised by Komendantskaya’s related EPSRC grants EP/J014222/1 (£120K) and EP/K031864/1 (£430K) and SICSA Distinguished Visitor grant for Power. CSL is a major international conference run by the EACSL since 1987; in 2011, its acceptance rate was 31%.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
