Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.17138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914929631559680 |
|---|---|
| author | Domoratskiy, Eridan Boulytchev, Dmitry |
| author_facet | Domoratskiy, Eridan Boulytchev, Dmitry |
| contents | We present a miniKanren-based type inferencer for an educational programming language with first-class functions, S-expressions, and pattern-matching. The language itself is untyped which adds a certain specificity to the problem and requires the employment of techniques conventionally used in implicit/gradual typing settings. The presence of polymorphic and recursive types poses a certain challenge when implementing the inferencer in miniKanren and requires a number of tricks, optimizations, and extensions to be used; we report on those as well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_17138 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Relational Solver for Constraint-based Type Inference Domoratskiy, Eridan Boulytchev, Dmitry Programming Languages We present a miniKanren-based type inferencer for an educational programming language with first-class functions, S-expressions, and pattern-matching. The language itself is untyped which adds a certain specificity to the problem and requires the employment of techniques conventionally used in implicit/gradual typing settings. The presence of polymorphic and recursive types poses a certain challenge when implementing the inferencer in miniKanren and requires a number of tricks, optimizations, and extensions to be used; we report on those as well. |
| title | A Relational Solver for Constraint-based Type Inference |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2408.17138 |