Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,148,151 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
First-order logic
Intuitionistic logic
Natural deduction
Normalisation by evaluation
Expand
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
Ulrich Berger
,
Kenj I Miyamoto
,
H. Schwichtenberg
,
M. Seisenberger
Conference on Algebra and Coalgebra in Computer…
2011
Corpus ID: 9400752
Minlog is an interactive system which implements proof-theoretic methods and applies them to verification and program extraction…
Expand
2011
2011
From coinductive proofs to exact real arithmetic: theory and applications
Ulrich Berger
Log. Methods Comput. Sci.
2011
Corpus ID: 11423636
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number…
Expand
2010
2010
Program extraction via typed realisability for induction and coinduction.
M. Seisenberger
2010
Corpus ID: 16320704
We study a realisability interpretation for interleaved inductive and coinductive definitions and discuss its application to…
Expand
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…
Expand
2008
2008
Programs from proofs using classical dependent choice
M. Seisenberger
Annals of Pure and Applied Logic
2008
Corpus ID: 9893770
2007
2007
Light Dialectica Program Extraction from a Classical Fibonacci Proof
Mircea Dan Hernest
DCM@ICALP
2007
Corpus ID: 8034353
2007
2007
Program Extraction from Proofs
H. Schwichtenberg
2007
Corpus ID: 115460942
In classical mathematics, a Platonistic view of the mathematical universe is adopted according which mathematical entities…
Expand
2006
2006
Simplifying Programs Extracted from Classical Proofs
Yevgeniy Makarov
2006
Corpus ID: 14919264
Curry-Howard isomorphism extended to classical logic by associating the rule of double-negation elimination with the control…
Expand
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…
Expand
Highly Cited
1998
Highly Cited
1998
Proof Theory at Work: Program Development in the Minlog System
Benl
,
Berger
,
Schwichtenberg
,
Seisenberger
,
Zuber
1998
Corpus ID: 14568271
The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in…
Expand
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)
ACCEPT & CONTINUE