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
2011
Review
2011
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
Minlog is an interactive system which implements proof-theoretic methods and applies them to verification and program extraction… 
2011
2011
From coinductive proofs to exact real arithmetic: theory and applications
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number… 
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… 
2009
2009
From Coinductive Proofs to Exact Real Arithmetic
  • Ulrich Berger
  • Annual Conference for Computer Science Logic
  • 2009
  • Corpus ID: 14989233
We give a coinductive characterization of the set of continuous functions defined on a compact real interval, and extract… 
2008
2008
Programs from proofs using classical dependent choice
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… 
1998
1998
Decision Procedures for Intuitionistic Propositional Logic by Program Extraction
  • Klaus Weich
  • International Conference on Theorem Proving with…
  • 1998
  • Corpus ID: 6199359
We present two constructive proofs of the decidability of intuitionistic propositional logic by simultaneously constructing… 
Highly Cited
1998
Highly Cited
1998
Proof Theory at Work: Program Development in the Minlog System
The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in… 
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)