User loginNavigation |
Scoping based on control flow graphThe Anatomy of a Loop by Olin Shivers
From this concept, Shivers builds a sub-language for describing iterations which includes what is effectively a directed graph of scopes, rather than a simple tree. Parallel code paths (or perhaps a better description would be unordered code paths) can independently contribute to the binding scope of following code, without being visible to each other. (See the example of quicksort on page 11.) Is this too wierd for real programmers? Or is it a stunningly elegant way of capturing something important about parallel code flows? I vote for the second but I wonder what other LtUers think By rici at 2005-10-05 18:46 | LtU Forum | previous forum topic | next forum topic | other blogs | 11237 reads
|
Browse archivesActive forum topics |
Recent comments
6 weeks 5 days ago
7 weeks 12 hours ago
7 weeks 1 day ago
14 weeks 1 day ago
19 weeks 6 days ago
20 weeks 18 hours ago
20 weeks 6 days ago
23 weeks 5 days ago
25 weeks 1 day ago
25 weeks 1 day ago