Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
A Declarative Theorem Prover for First-Order Classical Logic
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.

leanTAP: A Theorem Prover for First-Order Classical Logic

This project implements leanTAP in clojure.core.logic.nominal closely following the alphaleanTAP implementation described in alphaleanTAP: A Declarative Theorem Prover for First-Order Classical Logic (PDF) and chapter of 10 of William Byrd's thesis (PDF).

The alphaleantap directory contains the original implementation in Scheme.

The cljtap directory contains the implementation in Clojure.


On the Pelletier problems, the Clojure implementation is roughly 1/3 faster on average than the original implementation tested with Petite Chez Scheme.

Chart with Clojure and Scheme results on Pelletier Problems

Warning: the results in the spreadsheet are based on a single run of each implementation. It would still be interesting for core.logic's sake to understand why the implementation in Clojure performs much worse on Problem 20 than the original one in Petite Chez Scheme.

Something went wrong with that request. Please try again.