Affiliation:
1. Inria, France / IRIF, France / University of Paris Diderot, France
Abstract
Equations is a plugin for the Coq proof assistant which provides a notation for defining programs by dependent pattern-matching and structural or well-founded recursion. It additionally derives useful high-level proof principles for demonstrating properties about them, abstracting away from the implementation details of the function and its compiled form. We present a general design and implementation that provides a robust and expressive function definition package as a definitional extension to the Coq kernel. At the core of the system is a new simplifier for dependent equalities based on an original handling of the no-confusion property of constructors.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mechanizing Refinement Types;Proceedings of the ACM on Programming Languages;2024-01-05
2. A Formalization of Core Why3 in Coq;Proceedings of the ACM on Programming Languages;2024-01-05
3. Practical and Sound Equality Tests, Automatically: Deriving eqType Instances for Jasmin’s Data Types with Coq-Elpi;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11
4. A Computational Cantor-Bernstein and Myhill’s Isomorphism Theorem in Constructive Type Theory (Proof Pearl);Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11
5. A Type-Based Approach to Divide-and-Conquer Recursion in Coq;Proceedings of the ACM on Programming Languages;2023-01-09