Dynamic ML without Dynamic Types (1997) [22 citations — 0 self]
http://www.dcs.ed.ac.uk/~stg/./DynamicML/dynamic.p
http://www.dcs.ed.ac.uk/home/stg/DynamicML/dynamic
CiteULike
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Stephen Gilmore and Dilsun Kírlí and Christopher Walton},
title = {Dynamic ML without Dynamic Types},
institution = {},
year = {1997}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We describe a variant of the Standard ML programming language which incorporates a facility for the replacement of modular components during program execution. This useful extension of the language builds upon existing compiler technology which permits the separate compilation of modular units of a Standard ML program. Defined naively, this extension would incur performance overheads due to the need to retain typing information at run-time. Here we explain how this cost can be significantly lessened and in some cases eliminated entirely. The essential technical device which we employ for implementation of our extension to the language is a modification of two-space copying garbage collection. Keywords: modular programming; static type checking; dynamic languages 1 Introduction Standard ML is a reliable and useful programming language which provides the expressivity of a functional programming language in a setting where the full power of imperative programming constructs is also avail...
Citations
No citations identified.
