The next generation of the NuPrl proof development system. The main new features of MetaPRL include: 1) Modularity. Programs and logics are developed as modules that define computational, heuristic, and mathematical properties. 2) Speed. MetaPRL is more than two orders of magnitude faster than NuPrl.

A proof-assistant for Pure Type Systems (PTSs), representing different logics and programming languages. A basic knowledge of Pure Type Systems and the Curry-Howard-de Bruijn isomorphism is required. (This isomorphism says how you can interpret types as propositions.)

The system documented originated at the Laboratory for Applied Logic of Brigham Young University and features higher-order, classical, natural deduction with tactics.

Homepage of the theorem prover environment developed by Larry Paulson at Cambridge University and Tobias Kipkow at TU Munich.

Emacs based generic interface for theorem provers.