Recycling proof patterns in Coq: case studies (Q475385): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071091648 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.6039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of Agda – A Functional Language with Dependent Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matita Interactive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Checked Proof of the Odd Order Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type classes for efficient exact real arithmetic in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: A verified information-flow architecture / 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: Q2729065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / 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: A constructive approach to sequential Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjecture synthesis for inductive theories / 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: Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Boolean functions in an infinite attribute space / 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: A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory / rank
 
Normal rank

Latest revision as of 08:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Recycling proof patterns in Coq: case studies
scientific article

    Statements

    Recycling proof patterns in Coq: case studies (English)
    0 references
    0 references
    26 November 2014
    0 references
    interactive theorem proving
    0 references
    Coq
    0 references
    SSreflect
    0 references
    machine learning
    0 references
    clustering
    0 references
    0 references
    0 references
    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