We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary standardization theorem. The proof is fully formalized in Coq using coinductive types. The paper concludes with a characterization of infinite lambda terms which reduce to themselves in a single beta step
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
International audienceWe introduce a linear infinitary λ-calculus, called Λ∞, in which two exponenti...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
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 re...
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge...
AbstractWe present an introduction to infinitary lambda calculus, highlighting its main properties. ...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infin...
When infinitary rewriting was introduced by Kaplan et.al. at the beginning of the 1990s, its term un...
Term rewriting is used for the modelling of computation in declarative languages and proof systems. ...
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 rew...
htmlabstractWe present a coinductive framework for defining infinitary analogues of equational reaso...
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
International audienceWe introduce a linear infinitary λ-calculus, called Λ∞, in which two exponenti...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
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 re...
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge...
AbstractWe present an introduction to infinitary lambda calculus, highlighting its main properties. ...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infin...
When infinitary rewriting was introduced by Kaplan et.al. at the beginning of the 1990s, its term un...
Term rewriting is used for the modelling of computation in declarative languages and proof systems. ...
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 rew...
htmlabstractWe present a coinductive framework for defining infinitary analogues of equational reaso...
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
International audienceWe introduce a linear infinitary λ-calculus, called Λ∞, in which two exponenti...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...