Types, Abstraction and Parametric Polymorphism
The work
| Authors | John C. Reynolds |
|---|---|
| Editors | R. E. A. Mason |
| Type | inproceedings |
| Year | 1983 |
| Citekey | reynolds1983types |
Where it appeared
| Published in | Information Processing 83 |
|---|---|
| Publisher | North-Holland |
| Pages | 513--523 |
Identifiers
| OpenAlex | W326743114 |
|---|
Related
| Distinct from | clarke1996formal |
|---|---|
| Distinct from | kahng2011vlsi |
| Distinct from | morris1973types |
Abstract
We explore the thesis that type structure is a syntactic discipline for maintaining levels of abstraction. Traditionally, this view has been formalized algebraically, but the algebraic approach fails to encompass higher-order functions. For this purpose, it is necessary to generalize homomorphic functions to relations; the result is an "abstraction" theorem that is applicable to the typed lambda calculus and various extensions, including user-defined types. Finally, we consider polymorphic functions, and show that the abstraction theorem captures Strachey's concept of parametric, as opposed to ad hoc, polymorphism.
A copy is held
pdf, 674.3 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | import via bibtex |
|---|---|
| Added | 2026-08-09 00:00 UTC |
| Approved by | a person 2026-09-04 18:18 UTC |
Filed under
Cite it as
@inproceedings{reynolds1983types,
title = {Types, Abstraction and Parametric Polymorphism},
author = {John C. Reynolds},
editor = {R. E. A. Mason},
year = {1983},
booktitle = {Information Processing 83},
publisher = {North-Holland},
pages = {513--523},
}
This record lives at https://refs.drheap.org/reynolds1983types/ and will keep doing so.