MINLOG
 | This article needs more citations. (February 2025) |
MINLOG is a proof assistant developed at LMU Munich by the team of Helmut Schwichtenberg.[1][2]
MINLOG is based on first order natural deduction calculus. It is intended to reason about computable functionals, using minimal rather than classical or intuitionistic logic. The primary motivation behind MINLOG is to exploit the proofs-as-programs paradigm for program development and program verification. Proofs are, in fact, treated as first-class objects, which can be normalized. If a formula is existential, then its proof can be used for reading off an instance of it or changed appropriately for program development by proof transformation. To this end, MINLOG is equipped with tools to extract functional programs directly from proof terms. This also applies to non-constructive proofs, using a refined A-translation. The system is supported by automatic proof search and normalization by evaluation as an efficient term rewriting device.
References
[edit]- ↑ Wiesnet, Franziskus (25 April 2018). "Introduction to Minlog". Proof and Computation. WORLD SCIENTIFIC: 233–288. doi:10.1142/9789813270947_0008. ISBN 978-981-327-093-0. Retrieved 15 February 2025.
- ↑ "Mathematische Logik - www.minlog-system.de". www.mathematik.uni-muenchen.de. Ludwig-Maximilians-Universität München. Retrieved 15 February 2025.
External links
[edit] | This formal methods-related article is a stub. You can help Wikipedia by adding missing information. |