Haskell resource: Typeclassopedia

by Colin Ross on February 16, 2009

Brent Yorgey has published a first draft of what looks to be a fantastic resource for the Haskell programmer who wants to understand what all those strange type classes like Applicative, Monoid and Functor actually mean.

[click to continue…]

Bookmark and Share

{ 0 comments }

XML parsing with Haskell

by Colin Ross on February 16, 2009

Although I have been aware of the existence of XML, I have never had any real experience of working with it. It looks like that is changing.

[click to continue…]

Bookmark and Share

{ 4 comments }

The difference between scripting and programming

January 27, 2009

Jeff Atwood asks the question “What’s the difference between a programming language and a scripting language?“. Although he doesn’t seem to come to a conclusion about that, he does decide that he is a scripter rather than a programmer. This is based on his experiences with BASIC (a scripting language) and C (a programming language). So [...]

Read the full article →

Does your IDE define you or support you?

January 18, 2009

As I have been watching the Masters snooker, there has been a great deal of discussion about Ronnie O’Sullivan breaking his cue before the tournament and then managing to play exceptionally well with a replacement which he has never used before.  The majority of commentators seem to believe that this shows O’Sullivan’s natural prowess and [...]

Read the full article →

Finding a member of an infinite list

January 12, 2009

Haskell, and GHC in particular never cease to amaze me.  While thinking about writing an infinite sorted list data type, I was playing around with ghci and discovered that it allows you to find a member of a list which is infinitely far from the beginning.  Then I discovered it didn’t.

Read the full article →

Notes on working with finite sorted lists

January 11, 2009

In a previous post, I wrote some information on ways to work with sorted infinite lists.  Since then I have investigated some more and realise that the code I gave could be considerably improved.  Particularly if you are interested in sorted finite lists.

Read the full article →

The fast, the right and the smart

January 8, 2009

Working my way through the puzzles in Project Euler is pretty enlightening at times.  I made it to level 1 yesterday to much acclaim and adulation.  Taking this as an opportunity to look back at the sort of  patterns I have been coding threw up a couple of interesting practises which I have been performing.

Read the full article →

Validation of use of Num2Str

January 7, 2009

It’s always good to see that the code you write has some real-life application, however small.  So, it was heartening to find a Project Euler problem that required exactly the functionality provided by my Num2Str utility.

Read the full article →

Testing a chat server

January 6, 2009

After my feeble fumblings towards what is quite possibly the most minimal HTTP server designed (minimal as in functionality rather than in minimal but complete according to specification), it was clear that part of the problem was trying to use HTTP preformance tools to test the chat server. To rectify this, it made sense that [...]

Read the full article →

Creating a minimal HTTP server in Haskell

January 6, 2009

I have been spending quite a lot of time lately looking at A simple TCP server written by the elusive and somewhat anonymous mrd.  It is, as the name suggests a simple TCP server which acts as a rudimentary chat server. Any input given is output to all clients. All very straightforward. [...]

Read the full article →

← Previous Entries