Calculemus 1.0.6

Automated Reasoning in First Order Logic

This is a fork of the repository https://github.com/jack-pappas/fsharp-logic-examples, which in turn is the porting in F# of the code from John Harrison's "Handbook of Practical Logic and Automated Reasoning".

Fork main purposes

• to have a .Net Core version of the solution
• to have a nuget package
• to create an api documentation

Fork main changes

• The conversion to .NET Core itself.

• The thm type has been changed from a simple type abbreviation of formula<fol> to a discriminated union with a single private case Theorem of formula<fol> to ensure that it is impossible to create new theorems without going through the inference rules defined and thus introduce theorems inconsistent with expressions of the type

      let t : thm = False
  

• In conjunction with the above change, the ProofOperators module in lcf has been renamed to ProofSystem like the original OCaml module.

• For better understanding of the source code and more modular documentation, the lib file has been split into a series of modules organized together in the FOL.lib (to maintain the reference to the original file) namespace.

• The name of the namespace has been changed to Calculemus (Automated Reasoning in First Order Logic).