dedukti: A type-checker for the λΠ-modulo calculus.
Dedukti is a proof checker for the λΠ-modulo calculus, a dependently typed λ-calculus with the addition of typed rewrite rules, capable of expressing proofs in Deduction Modulo [1].
- 1
- G. Dowek, Th. Hardin, C. Kirchner, Theorem proving modulo, Journal of Automated Reasoning, 31, 2003, pp. 33-72.
Downloads
- dedukti-1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.1.0, 1.1.1, 1.1.2, 1.1.3, 1.1.4 |
---|---|
Dependencies | base (>=4 && <5), bytestring (>=0.9.1.0), containers (>=0.2), directory, filepath, haskell-src-exts (>=1.1.0), hmk (>=0.9), mtl (>=1.1), parsec (>=3.0.0), process, Stream (>=0.3), text (>=0.3), time (>=1.1), wl-pprint (>=1.0) [details] |
License | LicenseRef-GPL |
Copyright | © 2009 CNRS - École Polytechnique - INRIA |
Author | Mathieu Boespflug |
Maintainer | Mathieu Boespflug <mboes@lix.polytechnique.fr> |
Category | Theorem Provers, Compilers/Interpreters |
Home page | http://www.lix.polytechnique.fr/~mboes/src/dedukti.git |
Uploaded | by MathieuBoespflug at 2009-10-01T20:35:45Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Executables | dedukti |
Downloads | 7261 total (21 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |