Changes between Version 1 and Version 2 of Ticket #61


Ignore:
Timestamp:
Apr 30, 2006 2:20:30 PM (8 years ago)
Author:
paolo
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #61 – Description

    v1 v2  
    11Currently, Haskell lacks production-grade bindings for mutable data structures, and has to rely on immutable data structures for storage. 
    22 
    3 For example, a sparse mutable array may be emulated by (IORef IntMap), and a mutable set may be emulated by (IORef Set).  However, these data structures have to be reconstructed almost from scratch for each insertion/deletions, resulting in low performance. 
     3For example, a sparse mutable array may be emulated by (IORef !IntMap), and a mutable set may be emulated by (IORef Set).  However, these data structures have to be reconstructed almost from scratch for each insertion/deletions, resulting in low performance. 
    44 
    55The Pugs project implements Perl 6 on top of Haskell; we would need fast implementations for mutable sparse array, mutable ordered mappings, mutable resizable byte-buffers, as well as mutable string-indexed Hash tables. 
     
    1111 
    1212== Interested Mentors == 
    13  * ??? 
     13 * ? 
    1414 
    1515== Interested Students ==