Cargando…
Practical Proof Search for Coq by Type Inhabitation
We present a practical proof search procedure for Coq based on a direct search for type inhabitants in an appropriate normal form. The procedure is more general than any of the automation tactics natively available in Coq. It aims to handle as large a part of the Calculus of Inductive Constructions...
Autor principal: | Czajka, Łukasz |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324019/ http://dx.doi.org/10.1007/978-3-030-51054-1_3 |
Ejemplares similares
-
Hammer for Coq: Automation for Dependent Type Theory
por: Czajka, Łukasz, et al.
Publicado: (2018) -
Computer arithmetic and formal proofs: verifying floating-point algorithms with the Coq system
por: Boldo, Sylvie, et al.
Publicado: (2017) -
Tit-Coq /
por: Gélinas, Gratien
Publicado: (1981) -
Characterization of Arabidopsis thaliana Coq9 in the CoQ Biosynthetic Pathway
por: Hu, Mei, et al.
Publicado: (2023) -
Lethal Neonatal CoQ Deficiency due to a COQ9 Variant
por: Finsterer, Josef, et al.
Publicado: (2018)