Tag Archives: finite

Species definition clarification and exercises

[This is the fourth in a series of posts about combinatorial species. Previous posts: And now, back to your regularly scheduled combinatorial species; Decomposing data structures; Combinatorial species definition.] In my previous post I neglected to mention something quite crucial, … Continue reading

Posted in math, species | Tagged , , , | 3 Comments

On a Problem of sigfpe

> {-# LANGUAGE TypeFamilies, EmptyDataDecls, TypeOperators, GADTs #-} At the end of his most recent blog post, Divided Differences and the Tomography of Types, Dan Piponi left his readers with a challenge: In preparation for the next installment, here’s a … Continue reading

Posted in haskell | Tagged , , , , , | 2 Comments