Exploiting parallelism in coalgebraic logic programming

DOI10.1016/j.entcs.2014.02.007zbMath1337.68054arXiv1312.4454OpenAlexW2051432956WikidataQ113317889 ScholiaQ113317889MaRDI QIDQ280198

Jónathan Heras, Ekaterina Komendantskaya, Martin Schmidt

Publication date: 6 May 2016

Full work available at URL: https://arxiv.org/abs/1312.4454

zbMATH Keywords

parallelismcoinductioncorecursionGoLangguardedness

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Unnamed Item, Logic programming: laxness and saturation, Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness, CoALP

Uses Software

• go

Cites Work

• Unnamed Item
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• On the algebraic structure of declarative programming languages
• Parallel complexity of logical query programs
• A theory of observables for logic programs
• Observable behaviors and equivalences of logic programs
• Saturated Semantics for Coalgebraic Logic Programming
• Coalgebraic Derivations in Logic Programming
• Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
• Coalgebraic Semantics for Derivations in Logic Programming
• Type Inference by Coinductive Logic Programming
• On the sequential nature of unification
• Communicating sequential processes
• An interactive semantics of logic programming