27 Feb
2009
27 Feb
'09
3:22 p.m.
Ryan Ingram <ryani.spam@gmail.com> wrote in article <2f9b2d30902151615n1e8e25e8ubbee20d93c8ecd32@mail.gmail.com> in gmane.comp.lang.haskell.cafe:
You can roll your own pure STT monad, at the cost of performance:
Do you (or anyone else) know how to prove this STT implementation type-safe? It seems to be safe but I'm not sure how to prove it. -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig A mathematician is a device for turning coffee into theorems. Paul Erdos (1913-1996)