| 1 |
Source: minlog |
| 2 |
Standards-Version: 4.7.2 |
| 3 |
Maintainer: Debian Science Maintainers <[email protected]> |
| 4 |
Uploaders: |
| 5 |
Andreas Tille <[email protected]>, |
| 6 |
Section: math |
| 7 |
Priority: optional |
| 8 |
Build-Depends: |
| 9 |
debhelper-compat (= 13), |
| 10 |
racket, |
| 11 |
texlive, |
| 12 |
Vcs-Browser: https://salsa.debian.org/science-team/minlog |
| 13 |
Vcs-Git: https://salsa.debian.org/science-team/minlog.git |
| 14 |
Homepage: http://www.minlog-system.de |
| 15 |
Rules-Requires-Root: no |
| 16 |
|
| 17 |
Package: minlog |
| 18 |
Architecture: all |
| 19 |
Depends: |
| 20 |
${misc:Depends}, |
| 21 |
racket | guile, |
| 22 |
Recommends: |
| 23 |
emacs25 | emacs24 | emacsen, |
| 24 |
Suggests: |
| 25 |
proofgeneral-minlog, |
| 26 |
quack-el, |
| 27 |
Description: Proof assistant based on first order natural deduction calculus |
| 28 |
intended to reason about computable functionals, using minimal |
| 29 |
rather than classical or intuitionistic logic. The main motivation |
| 30 |
behind MINLOG is to exploit the proofs-as-programs paradigm for |
| 31 |
program development and program verification. Proofs are in fact |
| 32 |
treated as first class objects which can be normalized. If a formula |
| 33 |
is existential then its proof can be used for reading off an instance |
| 34 |
of it, or changed appropriately for program development by proof |
| 35 |
transformation. To this end MINLOG is equipped with tools to extract |
| 36 |
functional programs directly from proof terms. This also applies to |
| 37 |
non-constructive proofs, using a refined A-translation. The system |
| 38 |
is supported by automatic proof search and normalization by |
| 39 |
evaluation as an efficient term rewriting device. |
| 40 |
. |
| 41 |
Minlog can be used with ProofGeneral, which allows proofs to be |
| 42 |
edited using emacs and xemacs. This requires the proofgeneral-minlog |
| 43 |
package to be installed. |