Abstraction preservation and subtyping in distributed languages (2006)
by
James J. Leifer
| Venue: | In Proc. ICFP |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Leifer06abstractionpreservation,
author = {James J. Leifer},
title = {Abstraction preservation and subtyping in distributed languages},
booktitle = {In Proc. ICFP},
year = {2006},
pages = {286--297},
publisher = {ACM}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
1. Introduction 1.1 Background and motivation Abstract types are a powerful feature of modern programminglanguages. They arise when the implementation of a collection of types and accompanying functions, often called a module, ispartly hidden by an interface. The creation and manipulation of an abstract data type are then constrained by the functions declared inits interface.
Citations
| 81 | The programming language Oberon - Wirth - 1988 |
| 46 | Syntactic type abstraction - Grossman, Morrisett, et al. |
| 20 | Types, abstraction and parametric polymorphism. Information processing - Reynolds - 1983 |
| 1 | Type-safedistributed programming for OCaml. Submitted for publication. http://www.cl.cam.ac.uk/users/pes20/hashcaml/. [2 - Billings, Sewell, et al. - 1989 |
| 1 | On understanding types, data abstraction,and polymorphism - Cardelli, Wegner - 1985 |
| 1 | An empirical study of the runtimebehavior of higher-order logic programs - Michaylov, Pfenning - 1992 |
| 1 | Subtyping and parametricity.In - Plotkin, Abadi, et al. - 1994 |
