Towards Rewriting in Coq
From MaRDI portal
Publication:3608814
Recommendations
Cited in
(15)- Nested abstract syntax in Coq
- From Sets to Bits in Coq
- scientific article; zbMATH DE number 6678680 (Why is no real title available?)
- A new look at generalized rewriting in type theory
- scientific article; zbMATH DE number 2000441 (Why is no real title available?)
- Encoding natural semantics in Coq
- Types for Proofs and Programs
- Importing HOL Light into Coq
- scientific article; zbMATH DE number 7649963 (Why is no real title available?)
- Types for Proofs and Programs
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- Proof search and proof check for equational and inductive theorems.
- Consistency and Completeness of Rewriting in the Calculus of Constructions
- Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
- An Isabelle/HOL formalization of semi-Thue and conditional semi-Thue systems
This page was built for publication: Towards Rewriting in Coq
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608814)