Calculating lenient programs' performance
| Author(s) : | Paul Roe, |
| Publisher : | N/A |
| Publication Date : | 1990 |
| ISSN : | N/A |
| Abstract : | Lenient languages, such as Id Nouveau, have been proposed for programming parallel computers. These languages represent a compromise between strict and lazy languages. The operation of parallel languages is very complex; therefore a formal method for reasoning about their performance is desirable. This paper presents a non-standard denotational semantics for calculating the performance of lenient programs. The semantics is novel in its use of time and time-stamps. 1, |
