Corpus ID: 220128267

Generating induction principles and subterm relations for inductive types using MetaCoq

@article{Liesnikov2020GeneratingIP,
  title={Generating induction principles and subterm relations for inductive types using MetaCoq},
  author={Bohdan Liesnikov and Marcel Ullrich and Yannick Forster},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.15135}
}
  • Bohdan Liesnikov, Marcel Ullrich, Yannick Forster
  • Published 2020
  • Computer Science
  • ArXiv
  • When one defines an inductive type in Coq there are various derivable definitions one frequently uses, like induction principles, subterm relations, equality deciders, countability proofs, alternative representations of constructors, etc. Some of these can be derived automatically by Coq or Coq plugins. For instance, Coq derives induction principles automatically: When one defines a type of balanced trees with leaves labelled by elements of A as follows 

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES