{"ID":2847365,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.00740","arxiv_id":"2511.00740","title":"Typed Embedding of miniKanren for Functional Conversion","abstract":"Relational programming enables program synthesis through a verifier-to-solver approach. An earlier paper introduced a functional conversion that mitigated some of the inherent performance overhead. However, the conversion was inelegant: it was oblivious to types, demanded determinism annotations, and implicit generator threading. In this paper, we address these issues by providing a typed tagless-final embedding of miniKanren into Haskell. This improvement significantly reduces boilerplate while preserving, and sometimes enhancing, earlier speedups.","short_abstract":"Relational programming enables program synthesis through a verifier-to-solver approach. An earlier paper introduced a functional conversion that mitigated some of the inherent performance overhead. However, the conversion was inelegant: it was oblivious to types, demanded determinism annotations, and implicit generator...","url_abs":"https://arxiv.org/abs/2511.00740","url_pdf":"https://arxiv.org/pdf/2511.00740v1","authors":"[\"Igor Engel\",\"Ekaterina Verbitskaia\"]","published":"2025-11-01T23:50:05Z","proceeding":"cs.PL","tasks":"[\"cs.PL\"]","methods":"[\"Generative Adversarial Network\"]","has_code":false}