Now on ScienceBlogs: Rhodes Secretary: Wall Street Megabonuses Draining Our Young Talent
Finding the fun in good math; Shredding bad math and squashing the crackpots who espouse it.
Mark Chu-Carroll (aka MarkCC) is a PhD Computer Scientist, who works for Google as a Software Engineer. My professional interests center on programming languages and tools, and how to improve the languages and tools that are used for building complex software systems.
Category: Haskell
(This is a revised repost of an earlier part of my Haskell tutorial.) Haskell is a strongly typed language. In fact, the type system in Haskell is both stricter and more expressive than any type system I've seen for...
Posted by Mark C. Chu-Carroll at 9:27 AM • 17 Comments •
Category: Haskell
(This is a heavily edited repost of the first article in my original Haskell tutorial.) (I've attempted o write this as a literate haskell program. What that means is that if you just cut-and-paste the text of this post from...
Posted by Mark C. Chu-Carroll at 3:47 PM • 8 Comments •
Category: Haskell
Way back, about three years ago, I started writing a Haskell tutorial as a series of posts on this blog. After getting to monads, I moved on to other things. But based on some recent philosophizing, I think I'm...
Posted by Mark C. Chu-Carroll at 1:46 PM • 35 Comments •
Category: Data Structures
It's been a while since I've written about any data structures. But it just so happens that I'm actually really working on implementing a really interesting and broadly useful data structure now, called a Rope. A bit of background,...
Posted by Mark C. Chu-Carroll at 10:14 PM • 11 Comments •
Category: Abstract Algebra
Since I mentioned the idea of monoids as a formal models of computations, John Armstrong made the natural leap ahead, to the connection between monoids and monads - which are a common feature in programming language semantics, and a...
Posted by Mark C. Chu-Carroll at 10:57 AM • 5 Comments •
Category: Haskell
So, after our last installment, describing the theory of monads, and the previous posts, which focused on representing things like state and I/O, I thought it was worth taking a moment to look at a different kind of thing...
Posted by Mark C. Chu-Carroll at 8:52 PM • 4 Comments •
Category: Basics
As long as I'm doing all of these basics posts, I thought it would be worth explaining just what a Turing machine is. I frequently talk about things being Turing equivalent, and about effective computing systems, and similar things,...
Posted by Mark C. Chu-Carroll at 6:38 PM • 18 Comments •
Category: Haskell
As promised, I'm finally going to get to the theory behind monads. As a quick review, the basic idea of the monad in Haskell is a hidden transition function - a monad is, basically, a state transition function. The...
Posted by Mark C. Chu-Carroll at 2:02 PM • 8 Comments •
Category: Haskell
Time for more monads. In this article, I'm going to show you how to implement a very simple state monad - it's a trivial monad which allows you to use a mutable state consisting of a single integer. Then...
Posted by Mark C. Chu-Carroll at 8:00 AM • 9 Comments •
Category: Haskell
The biggest nightmare for most people learning Haskell is monads. Monads are the key to how you can implement IO, state, parallelism, and sequencing (among numerous other things) in Haskell. The trick is wrapping your head around them....
Posted by Mark C. Chu-Carroll at 3:03 PM • 11 Comments •
PZ Myers 11.19.2009
James Hrynyshyn 11.20.2009
PZ Myers 11.14.2009
Ed Brayton 11.21.2009
Tim Lambert 11.12.2009
