Lambda the Ultimate

My latest blog entry talks about the proof engine of Modern Eiffel. The blog entry is a basic introduction to the proof engine. It shows the basic inference rules, the basic commands, it introduces some axioms to reason in the propositional calculus. A lot of proofs are demonstrated using the boolean operators "and" "or" and "=>".

The introduction should be easy to follow, even for SW developers without training in proof techniques and formal mathematics. The proof engine is intended to be easy to use and understand. The introduction to the proof engine demonstrates that writing proofs is just another form of programming (manipulating the state of the proof engine with proof commands).

Those not familiar with Modern Eiffel can read be previous blog entry to understand its basic concepts.