Scheduling complexity of interleaving search

DOI10.1007/978-3-030-99461-7_9OpenAlexW4285300837MaRDI QIDQ2163166

Dmitry Boulytchev, Dmitry Rozplokhas

Publication date: 10 August 2022

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

zbMATH Keywords

time complexitysymbolic execution\textsc{miniKanren}interleaving search

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Uses Software

• miniKanren
• KANREN

Cites Work

• Average-case analysis of unification algorithms
• Certified semantics for relational programming
• Relational synthesis for pattern matching
• Backtracking, interleaving, and terminating monad transformers
• Unnamed Item

This page was built for publication: Scheduling complexity of interleaving search