A theory of type polymorphism in programming
The source holds an abstract for this work, but its best open-access copy is under publisher-specific-oa, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| A Machine-Oriented Logic Based on the Resolution Principle | 1965 | 3,929 |
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| The Definition of Standard ML | 1997 | 2,415 |
| On understanding types, data abstraction, and polymorphism | 1985 | 1,681 |
Links
Topics
| Logic, programming, and type systems | Computer Science |
| Logic, Reasoning, and Knowledge | Computer Science |
| semigroups and automata theory | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports33 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 86a6d6715ff540a0…