Proof mining with dependent types (Q2364689): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IsaCoSy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ML4PG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq/SSReflect / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRMLT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WEKA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hipster / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SEPIA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2612129252 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.04680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rippling: Meta-Level Guidance for Mathematical Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining State-Based Models from Proof Corpora / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPIA: Search for Proofs Using Inferred Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing persistent homology within Coq/SSReflect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recycling proof patterns in Coq: case studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Algorithmic Cut-Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-Pattern Recognition and Lemma Discovery in ACL2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjecture synthesis for inductive theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hipster: Integrating Theory Exploration in a Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lemma Mining over HOL Light / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning-assisted theorem proving with millions of lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaSh: Machine Learning for Sledgehammer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: ATP and presentation service for Mizar formalizations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:49, 14 July 2024

scientific article
Language Label Description Also known as
English
Proof mining with dependent types
scientific article

    Statements

    Proof mining with dependent types (English)
    0 references
    0 references
    21 July 2017
    0 references
    interactive theorem proving
    0 references
    Coq
    0 references
    dependent types
    0 references
    tactics
    0 references
    machine learning
    0 references
    clustering
    0 references
    theory exploration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers