Filippo Bonchi ; Fabio Zanasi - Bialgebraic Semantics for Logic Programming

lmcs:1155 - Logical Methods in Computer Science, March 30, 2015, Volume 11, Issue 1 - https://doi.org/10.2168/LMCS-11(1:14)2015
Bialgebraic Semantics for Logic Programming

Authors: Filippo Bonchi ORCID-iD; Fabio Zanasi ORCID-iD

    Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs as coalgebrae on presheaves. Then, we make explicit the underlying algebraic structure by using bialgebrae on presheaves. The resulting semantics turns out to be compositional with respect to conjunction and term substitution. Also, it encodes a parallel model of computation, whose soundness is guaranteed by a built-in notion of synchronisation between different threads.


    Volume: Volume 11, Issue 1
    Published on: March 30, 2015
    Accepted on: June 25, 2015
    Submitted on: February 28, 2014
    Keywords: Computer Science - Logic in Computer Science

    Linked data

    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.calco.2021.17
    • 10.4230/lipics.calco.2021.17
    Functorial Semantics as a Unifying Perspective on Logic Programming
    Gu, Tao ; Zanasi, Fabio ;

    5 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 537 times.
    This article's PDF has been downloaded 415 times.