Certified semantics for relational programming

DOI10.1007/978-3-030-64437-6_9zbMath1476.68043arXiv2005.01018OpenAlexW3110303672MaRDI QIDQ2038082

Dmitry Boulytchev, Dmitry Rozplokhas, Andrey Vyatkin

Publication date: 8 July 2021

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Logic programming (68N17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Scheduling complexity of interleaving search

Uses Software

• Unnamed Item

This page was built for publication: Certified semantics for relational programming