Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.23904 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908291900112896 |
|---|---|
| author | Flesselle, Eugène |
| author_facet | Flesselle, Eugène |
| contents | We propose a calculus for modeling implicit programming that supports first-class, overlapping, locally scoped, and higher-order instances with higher-kinded types. We propose a straightforward generalization of the well-established System $F^ω$ to implicit parameters, with a uniform treatment of type and term abstractions. Unlike previous works, we give a declarative specification of unambiguous, and thus coherent, resolution without introducing restrictions motivated by an algorithmic formulation of resolution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23904 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | System $F^ω$ with Coherent Implicit Resolution Flesselle, Eugène Programming Languages We propose a calculus for modeling implicit programming that supports first-class, overlapping, locally scoped, and higher-order instances with higher-kinded types. We propose a straightforward generalization of the well-established System $F^ω$ to implicit parameters, with a uniform treatment of type and term abstractions. Unlike previous works, we give a declarative specification of unambiguous, and thus coherent, resolution without introducing restrictions motivated by an algorithmic formulation of resolution. |
| title | System $F^ω$ with Coherent Implicit Resolution |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2503.23904 |