MINLOG (original) (raw)
MINLOG is a proof assistant developed at the University of Munich by the team of Helmut Schwichtenberg. MINLOG is based on first order natural deduction calculus. It is intended to reason about , 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 . The
| Property | Value |
|---|---|
| dbo:abstract | MINLOG is a proof assistant developed at the University of Munich by the team of Helmut Schwichtenberg. MINLOG is based on first order natural deduction calculus. It is intended to reason about , 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 . The system is supported by automatic proof search and normalization by evaluation as an efficient term rewriting device. (en) |
| dbo:wikiPageExternalLink | http://www.mathematik.uni-muenchen.de/~logik/minlog/ |
| dbo:wikiPageID | 33078890 (xsd:integer) |
| dbo:wikiPageLength | 1175 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1003761297 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Proof_assistant dbr:Intuitionistic_logic dbr:Minimal_logic dbr:First-order_logic dbr:Normalization_by_evaluation dbr:Natural_deduction dbr:Helmut_Schwichtenberg dbr:Term_rewriting dbc:Proof_assistants dbr:Classical_logic dbr:A-translation dbr:Computable_functionals |
| dct:subject | dbc:Proof_assistants |
| gold:hypernym | dbr:Assistant |
| rdf:type | dbo:Person yago:Assistant109815790 yago:CausalAgent100007347 yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:Worker109632518 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Whole100003553 yago:WikicatProofAssistants |
| rdfs:comment | MINLOG is a proof assistant developed at the University of Munich by the team of Helmut Schwichtenberg. MINLOG is based on first order natural deduction calculus. It is intended to reason about , 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 . The (en) |
| rdfs:label | MINLOG (en) |
| owl:sameAs | freebase:MINLOG yago-res:MINLOG wikidata:MINLOG https://global.dbpedia.org/id/4rAVq |
| prov:wasDerivedFrom | wikipedia-en:MINLOG?oldid=1003761297&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:MINLOG |
| is dbo:wikiPageWikiLink of | dbr:Proof_assistant dbr:Normalisation_by_evaluation |
| is foaf:primaryTopic of | wikipedia-en:MINLOG |