Recent posts
- More on Free Applicative Functors
Since free applicative functors are free, does that mean they are monads over indexed types? Also, can we squeeze out any more performance? (2013-06-12)
- Prompt Monads are Free
A brief look at
Promptmonads, showing that they are free monads, thatPromptis a monad over indexed types, and how it can be used to build composable components. (2013-06-07) - ZedneWeb 2013
After ten years, it’s time for a new content manager here at ZedneWeb. And after 12½ years, it’s time for a new look. You’ll probably never experience the former, and you can already see the latter, but here’s a blog post about it anyway. (2013-06-06)
- Stop helping me!
When I tried to enter that last post, it crashed my content manager. Turns out, my ancient code was using the wrong kind of string substitution, one which “helpfully” interprets the replacement string. Works fine until you try to post an entry containing the text
\g. (2013-05-27) - Free Applicative Functors in Haskell
Can we find a way to make an applicative functor for any type constructor? It turns out, methods are already known—but I didn’t know that when I started, so I found my own way. One that turns out to have much better performance. (2013-05-27)
- Parameterized monads vs monads over indexed types
Parameterized monads are a known way of extending the monadic interface. As an alternative, Conor McBride suggested using monads over indexed types. How do these approaches compare? (2012-07-29)
- Ronald C. Menendez, 1949–2010
Ronald C. Menendez, of Chatham, New Jersey, passed away peacefully on Wednesday evening, August 11, 2010. (2010-08-17)
- So that was 2008
What a year this has been. Despite the silence at ZedneWeb, America elected a new president and I got a new niece. (2008-12-31)
Feeds
Departments
Elsewhere
Topics
Archives
ZedneWeb is hosted by The Eyrie, a repository of Internet fiction (among other things).