Scratch that. I think you might be right. On May 25, 2016 8:40 PM, "David Feuer" <[email protected]> wrote:
> Partially. Unfortunately, bidirectional pattern synonyms tie the types of > the pattern synonyms to the types of the smart constructors for no good > reason, making them (currently) inappropriate. But fixing that problem > would offer one way to this optimization, I think. > On May 25, 2016 8:37 PM, "Carter Schonwald" <[email protected]> > wrote: > > could this be simulated/modeled with pattern synonyms? > > On Wed, May 25, 2016 at 7:51 PM, David Feuer <[email protected]> > wrote: > >> I've started a wiki page, >> https://ghc.haskell.org/trac/ghc/wiki/OptimizeCountingGADTs , to >> consider optimizing GADTs that look like natural numbers but that possibly >> have "heavy zeros". Please take a look. >> >> _______________________________________________ >> ghc-devs mailing list >> [email protected] >> http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-devs >> >> >
_______________________________________________ ghc-devs mailing list [email protected] http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-devs
