First commit - working type-based non-negative path, and one side of a bijection from trees to non-negative paths.
First working isomorphism! Between Tree and Dyck. Woohoo!
Tiny formatting tweak
Uncommented a thing I'll work on later.
Rearranged some code.
Working parseDyck implementation, using zippers to go through trees to Dyck paths
Added unparsing of NNPaths, as well as renamed N to Node, and added a comment describing an alternative implementation of split.
Comment about split and primeness of Dyck paths
New show instance using new (-) operator; reduced number of LANGUAGE pragmas used.
Modified |+| operator to take the opposite order of arguments, so that it agrees with the - operator and makes sense to the user
Fixed split so that it returns reverse of previous version -- this allows foldr1 (|+|) . split === id once more
Revert "New show instance using new (-) operator; reduced number of LANGUAGE pragmas used."

This reverts commit cc0ba1bf744528c903145d7926013cd5451a1cd5.

Conflicts:
	catalan.hs
Added comment about parsing identities
Revert "Revert "New show instance using new (-) operator; reduced number of LANGUAGE pragmas used.""

This reverts commit d8f20c3467114abde0ab86cf50b4f9dd2acdb731.
Made everything make sense given the new reversed syntax for constructing NNPaths.
Fixed silly error where I forgot to construct a tree
Removed old commented code
Added comment about trees
Added documentation in comments, haddock-friendly
Rendered documentation