* Efficient representation of free category
Using type aligned real time queues (Okasaki, 'Purely Functional Data
Structures') to represent catanable type allign lists (free categories).
Composition is O(1) and right fold is O(n), where n is number of
transitions.
* Bump version to 0.0.3
Make it compile on ghc802.
* Updated CI configuration
