Name
Abstract | ||
|---|---|---|
Types The interaction between the use of Dynamic and abstract data types gives rise to a puzzling design issue: should the type tag of a dynamically typed value containing an element of an abstract type be matched abstractly or concretely? There are good arguments for both choices: ffl Abstract matching protects the identity of "hidden " representation types and prevents accidental matches in cases where several abstract types happen to have the same representation. ffl Transparent matching... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1017/S095679680000126X | J. Funct. Program. |
Keywords | Field | DocType |
dynamic typing,abstract data type,polymorphism | Abstract data type,Programming language,Computer science,System F,Typing,Polymorphism (computer science),Subtyping | Journal |
Volume | Issue | Citations |
5 | 1 | 55 |
PageRank | References | Authors |
3.90 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Abadi | 1 | 12074 | 1324.31 |
| Luca Cardelli | 2 | 6221 | 1002.41 |
| Benjamin C. Pierce | 3 | 4196 | 302.91 |
| Didier Rémy | 4 | 682 | 49.82 |