24 Feb
2011
24 Feb
'11
12:27 p.m.
On 24/02/2011 09:30, oleg@okmij.org wrote:
The sort of laziness needed for non-deterministic programming calls for first-class store. It can be emulated, albeit *imperfectly*, for example, as was described in the ICFP09 paper.
What do you mean by "imperfectly"? Do you think implementing 'probM' with 'share' would lead to the same performance problems you experienced in probM.hs?
Ideally first-class memory is provided as built-in, since it requires interaction with garbage collection. Greg Morrisett has written extensively on this topic and done a few implementations; see for example, http://www.eecs.harvard.edu/~greg/papers/jgmorris-callcs.ps