Encapsulating non-determinacy in an abstract data type with determinate semantics
Journal of Functional Programming · 1991
DOI: 10.1017/s0956796800000046 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Functional Programming, 1991. Verfasst von F. Warren Burton. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 14 Literaturangaben.
Abstract (Originalsprache)
A parallel program may be indeterminate so that it can adapt its behavior to the number of processors available. Indeterminate programs are hard to write, understand, modify or verify. They are impossible to debug, since they may not behave the same from one run to the next. We propose a new construct, a polymorphic abstract data type called an improving value , with operations that have indeterminate behavior but simple determinate semantics. These operations allow the type of indeterminate behavior required by many parallel algorithms. We define improving values in the context of a functional programming language, but the technique can be used in procedural programs as well.
Zitieren
APA
Burton, F. W. (1991). Encapsulating non-determinacy in an abstract data type with determinate semantics. Journal of Functional Programming. https://doi.org/10.1017/s0956796800000046
Vancouver
Burton FW. Encapsulating non-determinacy in an abstract data type with determinate semantics. Journal of Functional Programming. 1991. doi:10.1017/s0956796800000046
BibTeX
@article{Burton1991,
author = {Burton, F. Warren},
title = {Encapsulating non-determinacy in an abstract data type with determinate semantics},
journal = {Journal of Functional Programming},
year = {1991},
doi = {10.1017/s0956796800000046}
}
EUVIMED