We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define Equation found, the infinitary extension of a given equational theory =R, and →∞, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: (Formula Presented) Equation found Here μ and ν are the least and greatest fixed-point operators, respectively, and (Formula Presented) Equation found The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers
Proof terms in term rewriting are a representation means for reduction sequences, and more in genera...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
We present a coinductive framework for defining and reasoning about the infinitary analogues of equa...
We present a coinductive framework for defining infinitary analogues of equational reasoning and rew...
htmlabstractWe present a coinductive framework for defining infinitary analogues of equational reaso...
htmlabstractrewriting in a uniform way. We define the relation 1=, a notion of infinitary equational...
We present a coinductive framework for defining and reasoning about theinfinitary analogues of equat...
We present a coinductive framework for defining infinitary analogues of equational reasoning and re...
Contains fulltext : 143600_pre.pdf (preprint version ) (Open Access) ...
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge...
Infinitary Term Rewriting allows to express infinite terms and transfinite reductions that converge ...
Term rewriting is used for the modelling of computation in declarative languages and proof systems. ...
Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediatedev...
We provide a coinductive definition of strongly convergent reductions between infinite lambda terms....
Proof terms in term rewriting are a representation means for reduction sequences, and more in genera...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
We present a coinductive framework for defining and reasoning about the infinitary analogues of equa...
We present a coinductive framework for defining infinitary analogues of equational reasoning and rew...
htmlabstractWe present a coinductive framework for defining infinitary analogues of equational reaso...
htmlabstractrewriting in a uniform way. We define the relation 1=, a notion of infinitary equational...
We present a coinductive framework for defining and reasoning about theinfinitary analogues of equat...
We present a coinductive framework for defining infinitary analogues of equational reasoning and re...
Contains fulltext : 143600_pre.pdf (preprint version ) (Open Access) ...
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge...
Infinitary Term Rewriting allows to express infinite terms and transfinite reductions that converge ...
Term rewriting is used for the modelling of computation in declarative languages and proof systems. ...
Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediatedev...
We provide a coinductive definition of strongly convergent reductions between infinite lambda terms....
Proof terms in term rewriting are a representation means for reduction sequences, and more in genera...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...