Certified Semantics for Relational Programming

Rozplokhas, Dmitry; Vyatkin, Andrey; Boulytchev, Dmitry

doi:10.1007/978-3-030-64437-6_9

Cited by 5 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we recollect some known formal descriptions for miniKanren language that will be used as a basis for our development. The descriptions here are taken from [15] (with a few non-essential adjustments for presentation purposes) to make the paper self-contained, more details and explanations can be found there.…”

Section: Background: Syntax and Semantics Of Minikanrenmentioning

confidence: 99%

“…Informally, in a well-formed leaf state all free variables in goals and substitution respect the counter of free logical variables. This definition is in fact an instance of a more general definition of well-formedness for all states, introduced in [15], where it is proven that the initial state is well-formed and any transition from a well-formed state results in a well-formed one.…”

Section: Background: Syntax and Semantics Of Minikanrenmentioning

confidence: 99%

“…This paper presents a formal framework for scheduling cost complexity analysis for interleaving search in miniKanren. We use the reference operational semantics, reflecting the behaviour of actual implementations [15], and prove the soundness of our approach w.r.t. this semantics.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scheduling Complexity of Interleaving Search

Rozplokhas¹,

Boulytchev²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

miniKanren is a lightweight embedded language for logic and relational programming. Many of its useful features come from a distinctive search strategy, called interleaving search. However, with interleaving search conventional ways of reasoning about the complexity and performance of logical programs become irrelevant. We identify an important key component -scheduling -which makes the reasoning for miniKanren so different, and present a semi-automatic technique to estimate the scheduling impact via symbolic execution for a reasonably wide class of programs.

show abstract

Section: Background: Syntax and Semantics Of Minikanrenmentioning

confidence: 99%

Section: Background: Syntax and Semantics Of Minikanrenmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling Complexity of Interleaving Search

Rozplokhas¹,

Boulytchev²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…We consider the alphabet of constructors {C k i i } and relational symbols {R k i i } to be predefined and accompanied with their arities. The formal semantics of the language is best described in [29]. Here we only briefly introduce the semantics.…”

Section: Minikanrenmentioning

confidence: 99%

“…An introduction to the language and some of its extensions in a series of examples can be found in the book [7]. The formal certified semantics for MINIKANREN is described in [29].…”

Section: Introductionmentioning

confidence: 99%

An Empirical Study of Partial Deduction for miniKanren

Вербицкая¹,

Berezun²,

Boulytchev³

2021

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We study conjunctive partial deduction, an advanced specialization technique aimed at improving the performance of logic programs, in the context of relational programming language MINIKANREN. We identify a number of issues, caused by MINIKANREN peculiarities, and describe a novel approach to specialization based on partial deduction and supercompilation. The results of the evaluation demonstrate successful specialization of relational interpreters. Although the project is at an early stage, we consider it as the first step towards an efficient optimization framework for MINIKANREN.1. Term unification t 1 ≡ t 2 computes the most-general unification in the context of the current substitution. If it succeeds, the unifier is added into the current substitution and then it is returned as a singleton stream. Otherwise, an empty stream is returned.

show abstract

Scheduling Complexity of Interleaving Search

Rozplokhas

Boulytchev

2022

Functional and Logic Programming

View full text Add to dashboard Cite

Certified Semantics for Relational Programming

Cited by 5 publications

References 21 publications

Scheduling Complexity of Interleaving Search

Scheduling Complexity of Interleaving Search

An Empirical Study of Partial Deduction for miniKanren

Scheduling Complexity of Interleaving Search

Contact Info

Product

Resources

About