We give a continuation-based implementation of rewriting for systems in the LCF tradition. These systems must construct explicit proofs of equations when rewriting, and currently do so in a way that can be very space-inefficient. An explicit representation of continuations improves performance on large terms, and on long-running computations
Abstract. In the field of program transformation, one often transforms programs into continuation-pa...
This paper discusses a number of methods to prove termination of higher-order term rewriting systems...
Abstract. We focus on termination proofs of rewrite systems, especially of rewrite systems containin...
the date of receipt and acceptance should be inserted later Abstract We give a continuation-based im...
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...
Conditional rewrite rules are notorious for being difficult to implement in rewrite engines. This is...
The essence of compiling with continuations is that conversion to continuation-passing style (CPS) i...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
In the field of program transformation, one often transforms programs into continuation-passing styl...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
Term-rewriting systems, that is, sets of directed equations, provide a paradigm of computation with ...
Abstract. In the field of program transformation, one often transforms programs into continuation-pa...
This paper discusses a number of methods to prove termination of higher-order term rewriting systems...
Abstract. We focus on termination proofs of rewrite systems, especially of rewrite systems containin...
the date of receipt and acceptance should be inserted later Abstract We give a continuation-based im...
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...
Conditional rewrite rules are notorious for being difficult to implement in rewrite engines. This is...
The essence of compiling with continuations is that conversion to continuation-passing style (CPS) i...
Plotkin's -value calculus is sound but incomplete for reasoning about -transfor-mations on prog...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
Many systems are at least partly or implicitly based on term rewriting. Examples are functional lang...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
In the field of program transformation, one often transforms programs into continuation-passing styl...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
Term-rewriting systems, that is, sets of directed equations, provide a paradigm of computation with ...
Abstract. In the field of program transformation, one often transforms programs into continuation-pa...
This paper discusses a number of methods to prove termination of higher-order term rewriting systems...
Abstract. We focus on termination proofs of rewrite systems, especially of rewrite systems containin...