Extending Nunchaku to Dependent Type Theory

  title={Extending Nunchaku to Dependent Type Theory},
  author={Simon Cruanes and J. Blanchette},
  • Simon Cruanes, J. Blanchette
  • Published in HaTT@IJCAR 2016
  • Mathematics, Computer Science
  • Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for various proof assistants. In this short paper, we present some ideas to extend Nunchaku with partial support for dependent types and type classes, to make frontends for Coq and other systems based on dependent type theory more useful. 
    9 Citations
    Satisfiability Modulo Bounded Checking (Report)
    Satisfiability Modulo Bounded Checking
    • 4
    • PDF
    Tests and proofs for custom data generators
    • 2
    • PDF
    Coverage guided, property based testing
    • 5
    Mutation Analysis for Coq
    • 2
    • PDF
    IDVE: an integrated development and verification environment for JavaScript
    Computer Science and Metaphysics: A Cross-Fertilization
    • 10
    • PDF


    Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
    • 238
    • PDF
    Automatic proofs and refutations for higher-order logic
    • 30
    • PDF
    Type Classes and Overloading in Higher-Order Logic
    • 160
    • PDF
    Translating Dependent Type Theory into Higher Order Logic
    • 27
    • PDF
    First-Class Type Classes
    • 202
    • PDF
    Nitpicking c++ concurrency
    • 37
    • PDF
    Model Finding for Recursive Functions in SMT
    • 18
    • PDF
    A Decision Procedure for (Co)datatypes in SMT Solvers
    • 27
    • PDF
    Combining Testing and Proving in Dependent Type Theory
    • 48
    • Highly Influential
    Nitpick: A Checkable Specification Language
    • 24