This takes a proof term in a haskell-like concrete syntax and converts it into a LaTeX-formatted proof of in a termless logic. Currently supports only the propositional calculus
TODO: add first-order logic generalize and separate the pretty-printer clean up the generated latex source