https://wiki.haskell.org/index.php?title=HaskellImplementorsWorkshop/2013/Yang&feed=atom&action=historyHaskellImplementorsWorkshop/2013/Yang - Revision history2024-03-28T11:27:08ZRevision history for this page on the wikiMediaWiki 1.35.5https://wiki.haskell.org/index.php?title=HaskellImplementorsWorkshop/2013/Yang&diff=56843&oldid=prevEdward Z Yang: Created page with "= Resource Limits for Haskell = ''Edward Z. Yang'' Safe Haskell offers the tantalizing possibility of running arbitrary, untrusted code as part of Haskell programs. However,..."2013-09-16T06:35:16Z<p>Created page with "= Resource Limits for Haskell = ''Edward Z. Yang'' Safe Haskell offers the tantalizing possibility of running arbitrary, untrusted code as part of Haskell programs. However,..."</p>
<p><b>New page</b></p><div>= Resource Limits for Haskell =<br />
<br />
''Edward Z. Yang''<br />
<br />
Safe Haskell offers the tantalizing possibility of running arbitrary,<br />
untrusted code as part of Haskell programs. However, a major obstacle<br />
to this dream is how to bound the time and space usage of such untrusted code.<br />
In this talk, we would like to describe a first implementation of a resource limits system for Haskell, which reuses the preexisting conceptual framework GHC<br />
has for discussing time and space usage: the cost semantics for profiling.<br />
<br />
Our first implementation largely reuses the existing implementation<br />
of profiling, and requires relatively few changes to the runtime system.<br />
However, profiling imposes a substantial memory and time<br />
cost on Haskell programs; thus, we'd also like to describe a partially implemented alternate strategy which utilizes a block-structured heap<br />
for what should be dramatic performance improvements. We'd like to pose an open question: how can this scheme be implemented in a *parallel* garbage collector?</div>Edward Z Yang