Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
-
Updated
May 22, 2024 - Prolog
Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
resolution refutation is method of finding whether the given antecedent implies the consequent or not, it could also be used to check validity of the expressions.
Add a description, image, and links to the tautology-checking topic page so that developers can more easily learn about it.
To associate your repository with the tautology-checking topic, visit your repo's landing page and select "manage topics."