search

subttle / regular

Finite Automata and Regular Expressions for Regular Languages in Haskell
BSD 3-Clause "New" or "Revised" License
10 stars 1 forks source link

Benchmarking #13

Open subttle opened 3 years ago

subttle commented 3 years ago

I am considering use of criterion for benchmarking a few things. The tutorial makes it seem easy enough and hopefully even fun. :)