Pages that link to "Item:Q5747648"
From MaRDI portal
The following pages link to An Efficient Coq Tactic for Deciding Kleene Algebras (Q5747648):
Displayed 18 items.
- Programming and automating mathematics in the Tarski-Kleene hierarchy (Q406433) (← links)
- Building program construction and verification tools from algebraic principles (Q736461) (← links)
- Typing theorems of omega algebra (Q1931900) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Proof Pearl: regular expression equivalence and relation algebra (Q2392416) (← links)
- On tools for completeness of Kleene algebra with hypotheses (Q2695367) (← links)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- Deciding Regular Expressions (In-)Equivalence in Coq (Q2915138) (← links)
- On Completeness of Omega-Regular Algebras (Q2915143) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)
- Tactics for Reasoning Modulo AC in Coq (Q3100211) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- (Q5079743) (← links)
- (Q5094147) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
- Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642) (← links)