On Sep 10, 2009, at 3:43 AM, Philippe Meunier wrote:

 Progress is steady but slow, there's just a
ton of infrastructure code to write (anybody wants to write a
hashconsing library that can handle cyclic data structures, unions,
subtyping (and least upper bounds in general), and that's reasonably
efficient and GC-friendly?)


Make a list of concrete specs, publish it here. See whether we can't find volunteers. _________________________________________________
 For list-related administrative tasks:
 http://list.cs.brown.edu/mailman/listinfo/plt-dev

Reply via email to