Article 15
Hey! [Insert obligatory first post statement here]I've been messing around with Unity3d for the past week or so, and I have to say, it's very fun and simple to use.That said, one of the first things...
View ArticleFunctional Sorting in Haskell
Sorting is a fairly major topic of study when it comes to programming, and there are tons of ways to do it. I don't know how interesting these algorithms are to other people, but they have always been...
View Article99 Haskell Problems #13: Run-length Encoding
I've been working on The Ninety-Nine Haskell Problemslately, and I've come across a particular one that seems to be practical, and was a lot of fun to implement!The 99 Problems start out with a lot of...
View ArticleIntroducing fhck, a brainf*ck interpreter written in Haskell!
If you haven't heard of brainf*ck, you should totally check it out, because it's probably the coolest programming language of them all! Also, probably one of the simplest... That's why I decided to...
View ArticleMy first real code golf program!
I've always been interested in Code golf, which essentially boils down to creating the shortest possible program that completes some task. I finally got around to completing one of these challenges,...
View ArticleHaskell: Implementing a Fractional Data Type and Investigating the Expansion...
A couple of weeks ago, I completed Project Euler #57: Investigating the Expansion of the Square Root of 2. I found the problem really interesting, since it required me to write up my own fractional...
View ArticleClik here to view.
"Memorizing" the Unit Circle
I, like many others I'm sure, was told that I needed to memorize the unit circle while studying Pre-calculus in High School. This looks like a very daunting task at first glance, and it caused me a lot...
View ArticleClik here to view.
Graphs and Topological Sorting in the Functional Paradigm
What is a Graph?From Wikipedia: In mathematics, a graph is a representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by...
View ArticleUncountable Infinity and The Diagonalization Method
Introduction I took a class on Discrete Mathematics this past semester, and one of the topics we covered very briefly was the concept of countable and uncountable infinity. I didn't end up getting a...
View ArticleIntroductory Monads
What is a Monad? If you've used Haskell before, chances are that you've heard the term "monad" a good bit. But, you might not know what they are, or what they are really used for. It is my goal in...
View ArticleComonadic Trees
We've seen in the previous post what monads are and how they work. We saw a few monad instances of some common Haskell structures and toyed around with them a little bit. Towards the end of the post, I...
View ArticleClik here to view.
Graph Theory and the Handshake Problem
The Handshake Problem The Handshake Problem is something of a classic in mathematics. I first heard about it in an algebra course I took in high school, and it's stuck with me through the years. The...
View ArticleSymbolic Calculus in Haskell
Motivation It's relatively simple to write a program to approximate derivatives. We simply look at the limit definition of a derivative: $$ \frac{d}{dx} f(x) = \lim_{h \rightarrow 0} \frac{f(x+h) -...
View ArticleClik here to view.
Ludum Dare #27 (10 Seconds): A post-mortem
WTF is Ludum Dare?Ludum Dare is a friendly competition among game developers to see who can make the best game based on a given theme in 48 hours. This was the 27th competition, and the theme was "10...
View ArticleParsing and Negating Boolean Strings in Haskell
It appears that the dailyprogrammer subreddit is back after a pretty long hiatus, and they kicked back into gear with a really interesting problem. The problem was, paraphrasing: Given a Boolean...
View Article