Skip to search formSkip to main contentSkip to account menu

MINLOG

MINLOG is a proof assistant developed at the University of Munich by the team of Helmut Schwichtenberg. MINLOG is based on first order natural… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
First-order logicIntuitionistic logicNatural deductionNormalisation by evaluation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
A TUTORIAL FOR MINLOG, VERSION 5.0
This is a tutorial for the interactive proof system Minlog, Version 5.0, developed by Helmut Schwichtenberg and members of the… 
2013
2013
Extracting Imperative Programs from Proofs: In-place Quicksort
The process of program extraction is primarily associated with functional programs with less focus on imperative program… 
2013
2013
Program extraction from coinductive proofs and its application to exact real arithmetic
Program extraction has been initiated in the field of constructive mathematics, and it attracts interest not only from… 
2010
2010
Program extraction via typed realisability for induction and coinduction.
We study a realisability interpretation for interleaved inductive and coinductive definitions and discuss its application to… 
2007
2007
Light Dialectica Program Extraction from a Classical Fibonacci Proof
2007
2007
Program Extraction from Proofs
In classical mathematics, a Platonistic view of the mathematical universe is adopted according which mathematical entities… 
2006
2006
Simplifying Programs Extracted from Classical Proofs
Curry-Howard isomorphism extended to classical logic by associating the rule of double-negation elimination with the control… 
2005
2005
Internalising modified realisability in constructive type theory
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The… 
2005
2005
Applications of inductive definitions and choice principles to program synthesis
We describe two methods of extracting constructive content from classical proofs, focusing on theorems involving infinite… 
1998
1998
Decision Procedures for Intuitionistic Propositional Logic by Program Extraction
We present two constructive proofs of the decidability of intuitionistic propositional logic by simultaneously constructing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)