Category Archives: Haskell
Return type overloading in Haskell
Function overloading is very common in many programming languages like C# but most of the languages that I have used only support overloading based on function arguments. For example in C# there are several overloads on the String.IndexOf function where … Continue reading
Posted in Haskell
Leave a comment
Prime Factorization using Unfold in Haskell
I randomly yesterday started thinking about the unfoldr function in Haskell while working out at the gym (how nerdy is that, I am lifting iron but thinking of functional programming). Unfoldr take a single and an unfolding function and turns it into a …
Posted in Haskell
Leave a comment
Parameterized State Transformer Monad in F#?
I have have been playing around with F# and I decided to create a state monad. This worked out really well since I was able to leverage the F# computation expressions. I then decided to try to extend this and make it more general by creatin…
Posted in F#, Haskell, Programming
Leave a comment
Writing a Regular Expression parser in Haskell: Part 4
With the previous two modules in place we are now set up to use a DFA to match against a string. In my implementation I support either a greedy match or an short match. In a full featured regular expression … Continue reading
Posted in Haskell, Regular Expression
Leave a comment
Writing a Regular Expression parser in Haskell: Part 3
The third module in the simple regular expression parser is called: NFAtoDFA. Which as you might have guessed, takes the NFA that resulted from the first module and converts it into a DFA. The structure that the DFA uses is … Continue reading
Posted in Haskell, Regular Expression
Leave a comment
