Efficient Fair Conjunction for Structurally-Recursive Relations
The relational language miniKanren is designed to be completely declarative, but one of its basic operations --- conjucnction --- has somewhat imperative properties. Both the efficiency and the convergence a conjunction depends on the order of its conjuncts. Therefore, when writing relational program, a user must independently determine the most optimal order in each case.
In the talk we consider a more declarative approach to evaluating relational programs which is insensitive to the order of conjuncts and does not introduce essential performance overhead.
The talk is based on a paper P.Lozov, D.Boulytchev "Efficient Fair Conjunction for Structurally-Recursive Relations", which is accepted for publication to the workshop PEPM 2021.
Speaker: Peter Lozov
P.Lozov, D.Boulytchev "Efficient Fair Conjunction for Structurally-Recursive Relations"
The seminar will be held in google meet on Monday, November 23, at 17:30 (google meet room: https://meet.google.com/myu-dhmz-gvu)
- About seminars
30 November 2020СFPQ with all-path query semantics
23 November 2020Efficient Fair Conjunction for Structurally-Recursive Relations
16 November 2020Source-Tracking Unification via Context-Free Path Querying
9 November 2020Relational Synthesis for Pattern Matching
2 November 2020Definitional Proof-Irrelevance without K