[Haskell-cafe] Re: Records vs HList

2005-11-24 Thread Keean Schupke
David Menendez wrote: Keean Schupke writes: HList can do O(log n) by the way, if the labels have order, you can implement a binary search tree of labels (Of course all the accessor functions would need to be rewritten). The idea of writing a type-level balanced binary search tree fil

[Haskell-cafe] Re: Records vs HList

2005-11-23 Thread David Menendez
Keean Schupke writes: > HList can do O(log n) by the way, if the labels have order, you can > implement a binary search tree of labels (Of course all the accessor > functions would need to be rewritten). The idea of writing a type-level balanced binary search tree fills me with an uncertain mixtu

[Haskell-cafe] Re: Records vs HList

2005-11-23 Thread Keean Schupke
David Menendez wrote: Keean Schupke writes: David Menendez wrote: Chris Kuklewicz writes: Would the record system describe at http://lambda-the-ultimate.org/node/view/1119 also be convertable "into System Fw, GHC's existing, strongly-typeed intermediate language." ?