On Wed, Jul 9, 2014 at 6:38 PM, Jonathan S. Shapiro <[email protected]> wrote: > On Tue, Jul 8, 2014 at 12:31 PM, Sandro Magi <[email protected]> wrote: >> >> * first-class everything: basically, languages based on something like >> the pattern calculus whereby every value is classified as either an atom >> or a compound of atoms, and usual pattern matching can deconstruct >> everything piecewise. > > We dropped pattern matching from BitC after a while. I no longer remember > why, unless it was merely that it was too hard to implement at the time. I > do remember that multi-argument procedures and pattern matching didn't seem > to get along well.
I agree that pattern matching is weirdly hard to implement each time I've done it, but if we dropped this from bitc do we have any other way of safely and completely (no missed cases) destructuring algebraic datatypes? I also dislike pattern matching in terms of extensibility, so if we have something good to replace it I'm all for it. Geoffrey _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
