User loginNavigation |
Practical LazinessHi y'all! I have a language that I've been working on for a while that I intend to be lazy. At this point, the "flavor" of the language is pretty much set, but I'm still working out some of lower-level details, and I'm wondering about the implementation of laziness. Strict-evaluation is certainly easy to implement, since one never bothers to create thunks, but for non-strict evaluation, is there any literature on the practical elements that go into choosing how frequently to turn thunks into values? Do most implementations wait until they hit conditional forms or IO, or do they tend to put upper-bounds on how large a chain of thunks can get, or ... ? thanks! JimDesu By jimdesu at 2006-12-01 23:34 | LtU Forum | previous forum topic | next forum topic | other blogs | 7336 reads
|
Browse archives
Active forum topics |
Recent comments
33 weeks 2 min ago
33 weeks 3 hours ago
33 weeks 3 hours ago
1 year 3 weeks ago
1 year 7 weeks ago
1 year 8 weeks ago
1 year 8 weeks ago
1 year 11 weeks ago
1 year 16 weeks ago
1 year 16 weeks ago