Conditional term rewriting systems (CTRSs) are a natural extension of unconditional such systems (TRSs) allowing rules to be guarded by conditions. Conditional rules tend to be very intuitive and easy to formulate and are therefore used in several programming and specification languages, such as Maud
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs a...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
The dependency pairs approach, one of the most powerful techniques for proving termination of rewrit...
AbstractWe investigate the practically crucial property of operational termination of deterministic ...
We prove the correctness of a transformation from conditional rewrite systems (CTRS) into non condit...
AbstractWe formally define and prove the correctness of a transformation from conditional rewrite sy...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
[EN] The notion of operational termination provides a logic-based definition of termination of compu...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12904-4_11Th...
AbstractUnravelings, transformations from conditional term rewriting systems (CTRSs, for short) into...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
We introduce Context-sensitive Conditional Expression Reduction Systems (CERS) by extending and gen...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
[EN] Different termination properties of conditional term rewriting systems have been recently descr...
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs a...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
The dependency pairs approach, one of the most powerful techniques for proving termination of rewrit...
AbstractWe investigate the practically crucial property of operational termination of deterministic ...
We prove the correctness of a transformation from conditional rewrite systems (CTRS) into non condit...
AbstractWe formally define and prove the correctness of a transformation from conditional rewrite sy...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
[EN] The notion of operational termination provides a logic-based definition of termination of compu...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12904-4_11Th...
AbstractUnravelings, transformations from conditional term rewriting systems (CTRSs, for short) into...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
We introduce Context-sensitive Conditional Expression Reduction Systems (CERS) by extending and gen...
AbstractLazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempt...
[EN] Different termination properties of conditional term rewriting systems have been recently descr...
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs a...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
The dependency pairs approach, one of the most powerful techniques for proving termination of rewrit...
Add to ORKG