id,summary,reporter,owner,description,type,status,priority,resolution,keywords,cc,topic,difficulty,mentor
75,Implement STM Haskell for user-space micro-threads,wellsed,none,"Following the work of the ""Composable Memory Transactions"" [1] team of implementing STM Haskell on top of Concurrent Haskell [2] threads, I would like to implement a version of STM Haskell on top of user-space micro-threads.  The main goal would be to ease the development of user-space micro-thread synchronization primitives that do not depend upon Concurrent Haskell primitives or the underlying language runtime and operating system.  This allows the new STM Haskell to be authored in pure Haskell for user-space micro-thread programs.  The micro-threading model will be based on either Resumption Monad Transformers [3] or the CPS Monad [4], with the current bias to the former.  Target applications are network servers, operating systems (e.g., House [5]), computer games, and graphical user interfaces.  With luck, benchmarking will be performed with a non-trivial application.

Research Links:

[1] http://research.microsoft.com/~simonpj/papers/stm/

[2] http://research.microsoft.com/copyright/accept.asp?path=/users/simonpj/papers/concurrent-haskell.ps.gz&pub=ACM

[3] http://www.cs.missouri.edu/~harrison/drafts/CheapThreads.pdf

[4] http://www.cis.upenn.edu/~lipeng/papers/lz06submitted.pdf

[5] http://www.cse.ogi.edu/~hallgren/House/

== Interested Mentors ==
 * ?

== Interested Students ==
 * Ed Wesley Wells <[mailto:wellsed@gmail.com]>
 * Ivan Tarasov (navi) <[mailto:Ivan.Tarasov@gmail.com]>",proposed-project,closed,not yet rated,fixed,,,Concurrency,1 person Summer,not-accepted