Category Archives: Haskell

Writing a Regular Expression parser in Haskell: Part 2

The first module in my simple regular expression parse is called RegexToNFA.  This module exposes the types that make up a finite state machine and also the functions to convert a regular expression string into a finite state machine. My … Continue reading

Posted in Haskell, Regular Expression | Leave a comment

Writing a Regular Expression parser in Haskell: Part 1

A few weeks ago I read this article about writing a simple regular expression parser.  That article does a really good job of explaining the theory behind regular expression.  It then goes step by step into how to write a … Continue reading

Posted in Haskell, Regular Expression | Leave a comment

Breadth First Tree Traversal in Haskell

As my interest in functional languages has grown, I have become increasingly interested in using them to implement algorithms which I can already write with imperative languages. For example, I was taught to implement (and I assume most other people … Continue reading

Posted in Haskell | Leave a comment

Palindrome Creator in Haskell

The past few days I have been solving problems at this site called Project Euler.  This site contains many seemingly simple math programming problems.  I have been using Haskell to solve the problems on the site and in order to … Continue reading

Posted in Haskell | Leave a comment

Who would have thunk it?

I recently read this article about Lazy Computation in C#. What the article discusses is creating lazy evaluation in C#. Lazy evaluation is a key feature of functional languages like Haskell but is not common in imperative languages.  It is … Continue reading

Posted in C#, Haskell | Leave a comment