Add to ORKGWe present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standard relations like joinability, meetability, rewrite systems, e.g., confluence and strong normalization. Our main concern is on strong normalization, since this formalization is the basis of [3] (which is mainly about strong normalization of term rewrite systems; see also IsaFoR/CeTA’s website1). Hence lemmas involving strong normalization, constitute by far the biggest part of this theory
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
AbstractThis paper describes the simply typed 2λ-calculus, a language with three levels: types, term...
We present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standa...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
We study normalisation of multistep strategies, strategies that reduce a set of redexes at a time, f...
\u3cp\u3eRewriting notions like termination, normal forms and confluence can be described in an abst...
AbstractThe theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) every reducible...
Abstract rewrite systems define a reduction relation by a set of rules. An important aspect of such ...
International audienceWe introduce a new framework of algebraic pure type systems in which we consid...
In this paper we present the algebraic--cube, an extension of Barendregt's -cube with first- an...
Abstract. Completion is one of the most studied techniques in term rewriting. We present a new proof...
In this work we provide a new proof of the result by Gallier and Tannen that the combination of an a...
A rewrite closure is an extension of a term rewrite system with new rules, usually deduced by transi...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
AbstractThis paper describes the simply typed 2λ-calculus, a language with three levels: types, term...
We present an Isabelle formalization of abstract rewriting (see, e.g., [1]). First, we define standa...
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term re...
AbstractWe study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda...
We study normalisation of multistep strategies, strategies that reduce a set of redexes at a time, f...
\u3cp\u3eRewriting notions like termination, normal forms and confluence can be described in an abst...
AbstractThe theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) every reducible...
Abstract rewrite systems define a reduction relation by a set of rules. An important aspect of such ...
International audienceWe introduce a new framework of algebraic pure type systems in which we consid...
In this paper we present the algebraic--cube, an extension of Barendregt's -cube with first- an...
Abstract. Completion is one of the most studied techniques in term rewriting. We present a new proof...
In this work we provide a new proof of the result by Gallier and Tannen that the combination of an a...
A rewrite closure is an extension of a term rewrite system with new rules, usually deduced by transi...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
This thesis is about the combination of lambda-calculus with rewriting. We mainly study two properti...
AbstractThis paper describes the simply typed 2λ-calculus, a language with three levels: types, term...