All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
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…Â
(More)
Wikipedia
Create Alert
Topic mentions per year
Topic mentions per year
1993-2015
0
2
4
1993
2015
Related topics
Related topics
5 relations
First-order logic
Intuitionistic logic
Natural deduction
Normalisation by evaluation
(More)
Related mentions per year
Related mentions per year
1936-2018
1940
1960
1980
2000
2020
MINLOG
First-order logic
Natural deduction
Intuitionistic logic
Proof assistant
Normalisation 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
Laura Crosilla
,
Monika Seisenberger
,
Helmut Schwichtenberg
2014
This is a tutorial for the interactive proof system Minlog, Version 5.0, developed by Helmut Schwichtenberg and members of the…Â
(More)
Is this relevant?
Review
2011
Review
2011
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras
Ulrich Berger
,
Kenji Miyamoto
,
Helmut Schwichtenberg
,
Monika Seisenberger
CALCO
2011
Minlog is an interactive system which implements prooftheoretic methods and applies them to verification and program extraction…Â
(More)
Is this relevant?
2007
2007
Synthesis of Moduli of Uniform Continuity by the Monotone Dialectica Interpretation in the Proof-system MinLog
Mircea-Dan Hernest
Electr. Notes Theor. Comput. Sci.
2007
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of…Â
(More)
Is this relevant?
2006
2006
Minlog
Helmut Schwichtenberg
The Seventeen Provers of the World
2006
Â
Is this relevant?
2005
2005
Extracting Herbrand disjunctions by functional interpretation
Philipp Gerhardy
,
Ulrich Kohlenbach
Arch. Math. Log.
2005
Carrying out a suggestion by Kreisel, we adapt Gödel’s functional interpretation to ordinary first-order predicate logic(PL) and…Â
(More)
Is this relevant?
2002
2002
Normalization by evaluation
Matthias Eberl
2002
We extend normalization by evaluation ((rst presented in 4]) from the pure typed-calculus to general higher type term rewrite…Â
(More)
Is this relevant?
1998
1998
Benl, Berger, Schwichtenberg, Seisenberger, Zuber Proof Theory at Work: Program Development in the Minlog System
BERGER BENL
,
Schwichtenberg
1998
The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in…Â
(More)
Is this relevant?
1997
1997
Minlog: A Minimal Logic Theorem Prover
John K. Slaney
CADE
1997
Abs t rac t . MINLOG is a theorem prover for propositional minimal logic and Heyting's intuitionist logic. It implements a…Â
(More)
Is this relevant?
1997
1997
From Proofs to Programs in the Minlog System the Warshall Algorithm and Higman's Lemma
Monika Seisenberger
1997
The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in…Â
(More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Program Extraction from Normalization Proofs
Ulrich Berger
TLCA
1993
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog…Â
(More)
Is this relevant?