Pages
Categories
Tags
announcement applicative BlogLiterately category theory collaborative editing combinatorial species combinatorics darcs diagrams drawing EDSL FringeDC functional programming functor GHC ghci grad school graphics hackathon Hac φ haskell ICFP knowledge library list monad monads monoid partitions patch theory pedagogy Philadelphia pictures preorder programming reading release species talk tutorial type-level Typeclassopedia types UPenn xmonadArchives
- May 2013 (1)
- April 2013 (3)
- March 2013 (2)
- January 2013 (2)
- December 2012 (2)
- November 2012 (4)
- October 2012 (3)
- August 2012 (4)
- July 2012 (5)
- June 2012 (1)
- March 2012 (1)
- January 2012 (1)
- November 2011 (4)
- October 2011 (3)
- September 2011 (2)
- August 2011 (2)
- July 2011 (2)
- June 2011 (1)
- May 2011 (6)
- April 2011 (2)
- March 2011 (1)
- February 2011 (3)
- January 2011 (1)
- December 2010 (2)
- November 2010 (3)
- October 2010 (1)
- September 2010 (1)
- August 2010 (3)
- July 2010 (2)
- June 2010 (3)
- May 2010 (3)
- April 2010 (3)
- March 2010 (2)
- February 2010 (1)
- January 2010 (1)
- December 2009 (2)
- October 2009 (3)
- September 2009 (2)
- August 2009 (4)
- July 2009 (7)
- June 2009 (1)
- May 2009 (2)
- April 2009 (1)
- March 2009 (2)
- February 2009 (3)
- January 2009 (3)
- December 2008 (2)
- September 2008 (2)
- August 2008 (1)
- July 2008 (3)
- June 2008 (1)
- April 2008 (4)
- March 2008 (4)
- February 2008 (4)
- January 2008 (2)
- December 2007 (4)
- October 2007 (2)
- September 2007 (2)
- August 2007 (3)
- June 2007 (2)
Top Posts
Blogroll
Fun
Personal
Meta
Category Archives: haskell
Wanted GHC feature: warn about unused constraints
Consider the following function: foo :: (Show a, Ord a) => a -> a -> String foo x y = show x ++ show y Currently (as of GHC 7.2.1) when compiling this code with -Wall, no warnings are generated. … Continue reading
More counting lambda terms
Yesterday someone submitted a comment to an old post of mine about counting linear lambda terms, asking the following question: I am interested in a similar problem: given a natural number N, what is the number of different symply-typed closed … Continue reading
Posted in haskell
5 Comments
Announcing diagrams-0.4
I am pleased to announce the release of version 0.4 of diagrams, a full-featured framework and embedded domain-specific language for declarative drawing. The last announcement was of the 0.1 release; there have been quite a few changes and improvements since … Continue reading
Effective parse tree support for the working semanticist
If, like me, you spend large amounts of time designing, discussing, and proving things about programming languages and formal calculi, chances are you have used Ott (and if you do, but you haven’t, you are really missing out). You write … Continue reading
diagrams repos now mirrored on github!
I was quite excited when I learned that Owen Stephens was working on a two-way darcs-git bridge for his Google Summer of Code project. You see, I’m one of those holdouts who, despite acknowledging that github is pretty cool and … Continue reading
Math.Tau
I have just uploaded a new package to Hackage which defines the constant . Now if you wish to use in your program you can just cabal install tau and then import Math.Tau (tau), and be assured that you are … Continue reading
Unbound now supports “set” binders and GADTs
I have just uploaded version 0.3 of the Unbound library (and version 0.5 of RepLib). This version adds support for two major new features: The new permbind and setbind functions create binders that are alpha-equivalent “up to permutation”. For example, … Continue reading
Posted in haskell, projects
Leave a comment
Idempotent Template Haskell
Yesterday I was looking for a way to have some Template Haskell code generate a definition for a certain identifier if and only if such a definition did not already exist. Essentially I want to be able to call the … Continue reading
Hac phi 3!
Hac phi 3 is in full swing now: almost 30 people showed up for the first day of hacking yesterday and more are expected today! I’ve posted a few pictures here — more to come.
Posted in haskell
Leave a comment
Bit-rotted text adventure EDSL free to a good home
In early 2008 I started working on a Haskell embedded domain-specific language for authoring text adventure games. It didn’t get all that far since I didn’t know a whole lot about either text adventure games or Haskell. But I think … Continue reading