Typed Embedding of miniKanren for Functional Conversion
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918181858181120 |
|---|---|
| author | Engel, Igor Verbitskaia, Ekaterina |
| author_facet | Engel, Igor Verbitskaia, Ekaterina |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_00740 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Typed Embedding of miniKanren for Functional Conversion Engel, Igor Verbitskaia, Ekaterina Programming Languages 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. |
| title | Typed Embedding of miniKanren for Functional Conversion |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2511.00740 |