Simple Types for Polymorphic Functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918445646348288 |
|---|---|
| author | Jay, Barry Bader, Johannes |
| author_facet | Jay, Barry Bader, Johannes |
| contents | This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be hidden by abstract types, such as list types and function types. Even without any quantified types, it supports polymorphism beyond that of the Hindley-Milner type system that underpins functional programming, and an effective type inference algorithm. Also, the simplicity of the formalism should make other static program analyses easier. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_12194 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Simple Types for Polymorphic Functions Jay, Barry Bader, Johannes Logic in Computer Science F.3.3; D.3.1; F.4.1 This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be hidden by abstract types, such as list types and function types. Even without any quantified types, it supports polymorphism beyond that of the Hindley-Milner type system that underpins functional programming, and an effective type inference algorithm. Also, the simplicity of the formalism should make other static program analyses easier. |
| title | Simple Types for Polymorphic Functions |
| topic | Logic in Computer Science F.3.3; D.3.1; F.4.1 |
| url | https://arxiv.org/abs/2604.12194 |