99 search results - page 10 / 20 » Automated termination proofs for haskell by term rewriting |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
RTA
2004
Springer
14 years 22 days ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...