The original CH mapping, that is, "a proof is a program, the formula it proves is a type for the program" is quite hard to achieve because it tries to demonstrate that a particular statement is true. It is much easier to honestly fail in demonstrating that it is false.
I use github pages with jekyll and I'm pretty satisfied with it.
I have an additional wrinkle - I have a jekyll plugin I wrote that I want to use, so I have to run jekyll on my own machine and then commit the plain html output to a separate repository. Once it was set up though it doesn't look much different though, just one extra step (running ./push_site_live.sh) after I'm done.
I don't see how the code provided has any relation to the Curry-Howard correspondence, which is a statement relating types and proofs.