Channable Tech Blog company blog

How we made Haskell search strings as fast as Rust

In this post, we will describe our quest to create Alfred–Margaret, the fastest Haskell implementation of the Aho–Corasick string searching algorithm, which powers string search in Channable.
Points
246
HN comments
87
Submissions
1
Cited by
0 commenters

Programming LanguagesSoftware Engineering2019

On Hacker News

SubmittedTitle on HNPointsComments
Mar 13, 2019How we made Haskell search strings as fast as Rust by duijf24687

More from Channable Tech Blog

All 6 posts →

Related posts from the same era