Improving Refutational Completeness of Relational Search via Divergence Test

Rozplokhas, Dmitry; Boulytchev, Dmitri

doi:10.1145/3236950.3236958

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The study of formal semantics for miniKanren is also not a completely novel venture. In [22] a non-deterministic small-step semantics is described, and in [27] a big-step semantics for a finite number of answers is given; neither uses proof mechanization and in both works the interleaving is not addressed.…”

Section: Related Workmentioning

confidence: 99%

“…g i ; } g specification Figure 1 The syntax of the source language and the soundness result was proven; the development was mechanized in HOL. [22] presented a variant of nondeterministic operational semantics, and [27] used another variant of finite-set semantics. None of the previous approaches were capable of reflecting the distinctive property of miniKanren's searchinterleaving [16], thus deviating from the conventional understanding of the language.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Certified Semantics for Relational Programming

Rozplokhas¹,

Vyatkin²,

Boulytchev³

2020

Preprint

View full text Add to dashboard Cite

We present a formal study of semantics for relational programming language miniKanren. First, we formulate denotational semantics which corresponds to the minimal Herbrand model for definite logic programs. Second, we present operational semantics which models the distinctive feature of miniKanren implementation -interleaving, -and prove its soundness and completeness w.r.t. the denotational semantics. Our development is supported by a Coq specification, from which a reference interpreter can be extracted. We also derive from our main result a certified semantics (and a reference interpreter) for SLD resolution with cut and prove its soundness.

show abstract

Section: Related Workmentioning

confidence: 99%