Add to ORKGInternational audienceThe Size-Change Termination principle was first introduced to study the termination of first-order functional programs. In this work, we show that it can also be used to study the termination of higher-order rewriting in a system of dependent types extending LF
The present manuscript is a reflection on termination of higher-order rewrite systems. We concentrat...
International audienceDependency pairs are a key concept at the core of modern automated termination...
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip...
International audienceThe Size-Change Termination principle was first introduced to study the termin...
In [13], a new size-change principle was proposed to verify termination of functional programs autom...
International audienceWe provide a general and modular criterion for the termination of simply-typed...
Abstract. Two directions of recent work on program termination use the concepts of size-change termi...
This paper discusses a number of methods to prove termination of higher-order term rewriting systems...
We extend the termination proof methods based on reduction orderings to higher-order rewriting syste...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
Combining typing and size constraints for checking the termination of higher-order conditional rewri...
Many functional programs and higher order term rewrite systems contain, besides higher order rules, ...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
The present manuscript is a reflection on termination of higher-order rewrite systems. We concentrat...
International audienceDependency pairs are a key concept at the core of modern automated termination...
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip...
International audienceThe Size-Change Termination principle was first introduced to study the termin...
In [13], a new size-change principle was proposed to verify termination of functional programs autom...
International audienceWe provide a general and modular criterion for the termination of simply-typed...
Abstract. Two directions of recent work on program termination use the concepts of size-change termi...
This paper discusses a number of methods to prove termination of higher-order term rewriting systems...
We extend the termination proof methods based on reduction orderings to higher-order rewriting syste...
Abstract. A popular formalism of higher order rewriting, especially in the light of termination rese...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
Combining typing and size constraints for checking the termination of higher-order conditional rewri...
Many functional programs and higher order term rewrite systems contain, besides higher order rules, ...
AbstractLazy rewriting is a proper restriction of term rewriting that dynamically restricts the redu...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
The present manuscript is a reflection on termination of higher-order rewrite systems. We concentrat...
International audienceDependency pairs are a key concept at the core of modern automated termination...
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip...