lambdageek / unbound-generics

Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
https://hackage.haskell.org/package/unbound-generics/
BSD 3-Clause "New" or "Revised" License
56 stars 18 forks source link

Measure performance of locally nameless representation. #7

Open lambdageek opened 10 years ago

lambdageek commented 10 years ago

Perhaps using criterion.

Repeatedly opening/closing seems like an obvious expensive thing to do. And once we have the Rec and SetBind combinators, those seem quite costly. But benchmarks for all the Alpha operations would be good to have.