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 demonstra

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.