A reflection−based proof tactic for lattices in Coq
This paper presents a new proof tactic that decides equalities and inequalities between terms over lattices. It uses a decision procedure that is a variation on Whitman’s algorithm and is implemented using a technique known as proof by reflection. We will paint the essence of the approach in broad...
Egile Nagusiak: | James, D, Hinze, R |
---|---|
Beste egile batzuk: | Horváth, Z |
Formatua: | Liburua |
Argitaratua: |
2009
|
Antzeko izenburuak
-
A Reflection−based Proof Tactic for Lattices in Coq
nork: James, D, et al.
Argitaratua: (2009) -
A reflection−based proof tactic for lattices in Coq
nork: James, D, et al.
Argitaratua: (2010) -
CoqIOA : a formalization of IO automata in the Coq proof assistant
nork: Athalye, Anish (Anish R.)
Argitaratua: (2017) -
A Machine Proof System of Point Geometry Based on Coq
nork: Siran Lei, et al.
Argitaratua: (2023-06-01) -
Formal Proof of a Machine Closed Theorem in Coq
nork: Hai Wan, et al.
Argitaratua: (2014-01-01)