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...
Príomhchruthaitheoirí: | James, D, Hinze, R |
---|---|
Rannpháirtithe: | Horváth, Z |
Formáid: | LEABHAR |
Foilsithe / Cruthaithe: |
2009
|
Míreanna comhchosúla
-
A Reflection−based Proof Tactic for Lattices in Coq
de réir: James, D, et al.
Foilsithe / Cruthaithe: (2009) -
A reflection−based proof tactic for lattices in Coq
de réir: James, D, et al.
Foilsithe / Cruthaithe: (2010) -
CoqIOA : a formalization of IO automata in the Coq proof assistant
de réir: Athalye, Anish (Anish R.)
Foilsithe / Cruthaithe: (2017) -
A Machine Proof System of Point Geometry Based on Coq
de réir: Siran Lei, et al.
Foilsithe / Cruthaithe: (2023-06-01) -
Formal Proof of a Machine Closed Theorem in Coq
de réir: Hai Wan, et al.
Foilsithe / Cruthaithe: (2014-01-01)