Add to ORKGAbstract. Rewriting with lemmas is a central strategy in interactive theorem provers. We describe the Milawa rewriter, which makes use of assumptions, cal-culation, and conditional rewrite rules to simplify the terms of a first-order logic. We explain how we have developed an ACL2 proof showing the rewriter is sound, and how this proof can accommodate our rewriter’s many useful features such as free-variable matching, ancestors checking, syntatic restrictions, caching, and forcing
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
In a 2012 paper, Richard Statman exhibited an inference system, based on second order monadic logic ...
Adding rewriting to a proof assistant based on the Curry-Howard isomorphism,such as Coq, may greatly...
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We des...
This paper presents, we believe, the most comprehensive evidence of a theorem prover’s soundness to ...
Abstract. Milawa is a theorem prover styled after ACL2 but with a small kernel and a powerful reflec...
Abstract. Previous work by the authors generalized conditional rewrit-ing from the use of equalities...
Abstract. Rewriting is a form of inference, and one that interacts in several ways with other forms ...
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify ...
AbstractMany automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to s...
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complex...
Abstract. Due to its practical importance, context-dependent simplification with conditional lem-mas...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
International audienceDependently typed programming languages and proof assistants such as Agda and ...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
In a 2012 paper, Richard Statman exhibited an inference system, based on second order monadic logic ...
Adding rewriting to a proof assistant based on the Curry-Howard isomorphism,such as Coq, may greatly...
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We des...
This paper presents, we believe, the most comprehensive evidence of a theorem prover’s soundness to ...
Abstract. Milawa is a theorem prover styled after ACL2 but with a small kernel and a powerful reflec...
Abstract. Previous work by the authors generalized conditional rewrit-ing from the use of equalities...
Abstract. Rewriting is a form of inference, and one that interacts in several ways with other forms ...
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify ...
AbstractMany automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to s...
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complex...
Abstract. Due to its practical importance, context-dependent simplification with conditional lem-mas...
Article dans revue scientifique avec comité de lecture.First-order languages based on rewrite rules ...
International audienceDependently typed programming languages and proof assistants such as Agda and ...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
Dependently typed programming languages and proof assistants such as Agda and Coq rely on computatio...
In a 2012 paper, Richard Statman exhibited an inference system, based on second order monadic logic ...
Adding rewriting to a proof assistant based on the Curry-Howard isomorphism,such as Coq, may greatly...