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 | 11662 reads
|
Browse archives
Active forum topics
|
Recent comments
2 weeks 21 hours ago
2 weeks 5 days ago
2 weeks 6 days ago
2 weeks 6 days ago
3 weeks 5 days ago
4 weeks 1 day ago
4 weeks 1 day ago
4 weeks 1 day ago
5 weeks 3 days ago
5 weeks 4 days ago