8
Search Index in 150 Lines of Haskell (entropicthoughts.com)
submitted 1 year ago by Noughtmare@programming.dev to c/haskell@programming.dev
4 comments fedilink hide all child comments

I stumbled over Bart de Goede’s article on building a full-text search engine in 150 lines of Python, and was reminded of my quest to show how useful Haskell is for solving real-world problems. Python is an eminently practical language, so nobody is surprised this can be done in Python. But Haskell? The Python code spends a lot of time updating mutable dictionaries. Surely we cannot easily port this code over to Haskell.

Let’s find out.

you are viewing a single comment's thread
view the rest of the comments
[-] gedhrel@lemmy.world 5 points 1 year ago

"Since we are talking about aggregating documents into an index, the word semigroup might pop into our heads."

This is why Haskell tutorials have a bad rep. Why not use a common English term like "monoid" instead?

Snark aside, the <> approach to solving the problem piecewise and aggregating the results into a larger instance of the same type is a really convenient approach.

[-] Noughtmare@programming.dev 4 points 1 year ago* (last edited 1 year ago)
[-] gedhrel@lemmy.world 3 points 1 year ago

Yes! Steele's Fortress-era talks are amazing. Really thought-provoking.

[-] gedhrel@lemmy.world 1 points 1 year ago

Yes! Steele's Fortress-era talks are amazing. Really thought-provoking.

this post was submitted on 09 Apr 2025
8 points (100.0% liked)

Haskell

644 readers
1 users here now

founded 3 years ago
MODERATORS
haskman@programming.dev