Fact-checked by Grok 2 weeks ago

Abstract rewriting system

An abstract rewriting system (ARS), also known as an abstract reduction system, is a pair (A, \to) consisting of a set A of objects and a binary relation \to \subseteq A \times A, which models the process of transforming elements of A through successive rewrite steps defined by the relation.^[1]^[2] This formalism abstracts away from the specific structure of the objects, allowing the study of rewriting properties in a general setting applicable to diverse areas such as term rewriting, lambda calculus, and algebraic specifications.^[3]^[4] In an ARS, the relation \to generates a reflexive-transitive closure \to^*, representing finite sequences of rewrites, while the symmetric-transitive closure \approx defines an equivalence relation capturing joinability of terms via common descendants.^[2] Key concepts include normal forms, elements of A that admit no further rewrites (i.e., irreducible under \to), and reductions, chains of rewrites that may terminate in a normal form if the system is normalizing.^[1]^[4] A system is strongly normalizing if every reduction sequence terminates in a normal form, and weakly normalizing if every element has at least one such sequence; non-termination arises from infinite reduction paths.^[4] Central properties of ARSs revolve around confluence, also called the Church–Rosser property, which ensures that if two elements are related by \approx (i.e., b \leftarrow^* a \to^* c), then they join at a common descendant (b \to^* d \leftarrow^* c for some d).^[2]^[3] Local confluence, a weaker condition where single steps join (b \leftarrow a \to c implies joinability), combined with strong normalization, implies full confluence by Newman's lemma.^[2] Confluent and normalizing ARSs guarantee unique normal forms, enabling deterministic computation and equality checking.^[3]^[4] Originating from early work in lambda calculus by Alonzo Church in the 1930s, where confluence was first formalized as the Church–Rosser theorem, the abstract framework was systematized by Gérard Huet in 1980, unifying prior results on reduction properties and extending them to term rewriting systems via critical pair analysis.^[4]^[3] ARSs underpin applications in functional programming, automated theorem proving, and concurrency models, providing tools for analyzing termination and equivalence in computational systems.^[3]^[4]

Fundamentals

Definition

An abstract rewriting system (ARS), also known as an abstract reduction system, is a pair (A, \to), where A is a set of objects or terms and \to \subseteq A \times A is a binary relation called the one-step reduction relation.^[1]^[5] The relation \to captures single-step rewrite operations, such that a \to b indicates that the element a \in A directly reduces to b \in A in one step.^[5] Common notation includes \succ for the inverse relation (where b \succ a if a \to b), representing expansion or reverse reduction, and = for the reflexive-symmetric-transitive closure of \to, known as the conversion relation, which equates elements connected by any finite sequence of reductions and expansions.^[1] This framework abstracts the structure of reduction processes without specifying the nature of the elements in A or the rules defining \to.^[5] The concept of ARS originated in the 1930s and 1940s through foundational work on lambda calculus by Alonzo Church and Stephen Kleene, who developed reduction rules to model computation and function application.^[6] In the 1970s, researchers including Nachum Dershowitz generalized these ideas to arbitrary sets and relations, providing a unified abstract setting for studying diverse rewriting paradigms such as term rewriting systems.^[7]^[5]

Basic Notions

In an abstract rewriting system, the one-step reduction relation is the binary relation → ⊆ A × A itself, where a → b holds if and only if (a, b) ∈ →, indicating that b can be obtained from a by a single application of a rewrite rule.^[8] The multi-step reduction relation →⁺ is the transitive closure of →, consisting of all finite sequences of one or more one-step reductions; specifically, a →⁺ b if there exists n ≥ 1 and a sequence a = a₀ → a₁ → ⋯ → aₙ = b. This relation is generated inductively: the base cases are the one-step reductions (1-fold composition), and for k ≥ 1, the (k+1)-fold composition is obtained by composing the k-fold with a one-step reduction.^[8]^[9] The reflexive-transitive closure →* extends →⁺ by including the identity relation Id_A = {(a, a) | a ∈ A}, so a →* b if a = b or a →⁺ b, capturing finite sequences of zero or more reductions. Inductively, →* is the smallest relation containing Id_A and → that is closed under transitivity: the base cases are a →* a for all a ∈ A and a →* b for all (a, b) ∈ →, with the inductive step stating that if a →* b and b → c, then a →* c.^[8]^[9] The conversion relation ↔, also denoted =, is the equivalence relation generated by →, defined as the reflexive-symmetric-transitive closure of →. Equivalently, it is the transitive closure of the symmetric closure of →*, relating elements that can be connected by finite sequences of reductions and expansions.^[9]^[8] Reduction sequences are finite or infinite chains of elements connected by the one-step relation →, such as a finite sequence a = a₀ → a₁ → ⋯ → aₙ or an infinite sequence a₀ → a₁ → a₂ → ⋯; a normalizing sequence is a finite one that terminates in an irreducible element, where irreducibility means no further one-step reduction is possible from that element.^[8]^[9]

Examples

Simple Example

A simple example of an abstract rewriting system is the successor system on the natural numbers. The set A consists of the natural numbers \mathbb{N} = \{0, 1, 2, \dots \}. The binary relation \to is defined such that for every n \in \mathbb{N}, n \to n+1. This relation captures the successor operation abstractly as direct pairs, without reference to syntactic structure. For instance, starting from 0, one-step reductions yield $0 \to $1, and further steps produce the finite reduction sequence $0 \to 1 \to 2 \to 3. The reflexive transitive closure \to^* extends these to multi-step reductions, such as $0 \to^* 3, which includes the empty sequence where an element reduces to itself. This example illustrates core concepts of an ARS, including one-step reductions and reduction sequences, by modeling a straightforward successor rule on a countable set.

Term Rewriting Example

In term rewriting systems, the set A consists of terms constructed from a signature comprising function symbols, variables, and constants, allowing for structured expressions such as f(x, g(y)).^[10] The rewrite relation \to is specified by a finite set of rules of the form l \to r, where l and r are terms with l non-variable; a term t rewrites to \sigma(r) if t contains a subterm matching \sigma(l) for some substitution \sigma.^[10] A concrete illustration arises in encoding natural number arithmetic using Peano numerals, where constants include $0 and the unary successor function s, with binary addition +; the rules are x + 0 \to x and x + s(y) \to s(x + y). For instance, representing 2 as s(s(0)) and 1 as s(0), the term s(s(0)) + s(0) reduces via the second rule at the root position to s(s(s(0)) + 0), then applies the first rule to yield s(s(s(0))). More generally, reductions can occur at non-root positions, such as rewriting a subterm within a larger expression, enabling stepwise simplification.^[10] This setup exemplifies an abstract rewriting system by treating terms as abstract elements, where substitutions and subterm positions generalize the flat relation on an unstructured set A, abstracting away syntactic details like variables.^[10] In modern contexts, such as functional programming, term rewriting models beta-reduction in lambda calculus, where a rule like (\lambda x.M)N \to M[x := N] substitutes arguments into bodies, as in (\lambda x.x + 1)2 \to 2 + 1.^[6] For example, the arithmetic term $2 + 0 reaches its normal form 2 under these rules.

Core Properties

Normal Forms

In an abstract rewriting system (ARS) (A, \to), a normal form is defined as an element n \in A that is irreducible, meaning no element b \in A exists such that n \to b.^[9] This property ensures n cannot be reduced further under the given rewrite relation. A normal form of an element a \in A is any such n reachable via the reflexive-transitive closure of the reduction, i.e., a \to^* n, where n is irreducible.^[9] Weak normalization characterizes systems where every a \in A admits at least one reduction sequence terminating in a normal form. In contrast, strong normalization requires that every reduction sequence from any a \in A terminates in a normal form, precluding infinite reduction paths.^[9] Strong normalization thus implies termination but is a stricter condition than weak normalization. Normal forms are not necessarily unique in an ARS; multiple distinct normal forms may arise from the same starting element, with uniqueness holding in confluent systems.^[9] Consider a term rewriting system for natural numbers using the constant 0 and unary successor function s, with no rewrite rules defined. Here, terms like s(s(0)) are normal forms, as no reductions apply to them.^[11] For finite ARS, where A is a finite set and \to is explicitly specified, irreducibility of an element n is algorithmically decidable: enumerate all elements b \in A and check whether any satisfy n \to b, a finite procedure that confirms the absence of direct successors.^[9] Strong normalization in such systems implies overall termination.^[9]

Joinability

In an abstract rewriting system (ARS) defined as a pair (A, \to), where A is a set and \to \subseteq A \times A is a binary relation, two elements a, b \in A are joinable, denoted a \downarrow b, if there exists some c \in A such that a \to^* c and b \to^* c, where \to^* denotes the reflexive transitive closure of \to.^[12] This relation captures the reconvergence of reduction paths originating from distinct elements to a shared descendant, without requiring the paths to originate from a common ancestor. A peak in an ARS is a local divergence configuration of the form a \leftarrow u \to b, where the arrows represent single reduction steps (i.e., u \to a and u \to b). Peak joinability holds if a \downarrow b for every such peak. In contrast, a valley arises in the inverse direction as a \to u \leftarrow b, but joinability primarily emphasizes forward reductions to a common descendant, aligning with the directional nature of \to. Join diagrams visually represent these concepts, typically with solid arrows for reduction steps and branching paths from a common origin reconverging at a join point c; for instance, from a peak at u, paths to a and b extend downward to meet at c, illustrating local reconvergence.^[8] Consider a simple string rewriting example with the alphabet \{a, b\} and the single rule aa \to b. Starting from the string aaa, a peak arises: reducing the left pair yields ba, while reducing the right pair yields ab. Here, ba \not\downarrow ab since neither string reduces further under the rule, demonstrating a failure of peak joinability. In a confluent variant, such as an ARS on elements \{a, b, c, d, e, f, g\} with reductions a \to e \to b \to c \to f, e \to g \to d, and a \to f directly, pairs like e \downarrow f (both reduce to b \to c \to f) and a \downarrow f (via direct and multi-step paths) exemplify joinability, where branches from peaks reconverge.^[12]^[8] Joinability plays a foundational role in establishing confluence: an ARS is locally confluent if every peak is joinable, and by Newman's lemma, local confluence combined with termination implies global confluence, where any two elements reachable from a common origin are joinable.^[12] This local-to-global inference relies on the finite nature of reduction sequences under termination, ensuring all divergent paths eventually join without infinite branches. While the focus remains on finite reductions, joinability extends conceptually to infinite sequences in non-terminating systems, though decidability may fail without additional structure.^[8]

Confluence

Church-Rosser Property

In an abstract rewriting system (ARS), the Church-Rosser property states that if two elements a and b are interconvertible via a sequence of reductions and expansions, then they are joinable, meaning there exists some element c such that a reduces to c and b reduces to c. Formally, this is expressed as:

\forall a, b \in A \ (a \leftrightarrow^* b \Rightarrow \exists c \in A \ (a \to^* c \leftarrow^* b)),

where \to denotes a single reduction step, \to^* its reflexive-transitive closure, and \leftrightarrow^* the equivalence relation generated by \to and its inverse.^[13] Moreover, if normal forms exist for an element, they are unique, ensuring that the reduction process yields a canonical representative regardless of the order of rule applications.^[13] This uniqueness is particularly valuable in computational settings, as it guarantees that different reduction paths converge to the same outcome. The Church-Rosser property is equivalent to confluence.^[14] The Church-Rosser property was originally established by Alonzo Church and J. Barkley Rosser in 1936, who proved it for the \lambda-calculus as part of analyzing the properties of conversion in typed and untyped settings.^[15] Their result demonstrated that \beta-reductions in \lambda-calculus satisfy the property, laying foundational groundwork for functional programming and proof theory. In the 1970s, as term rewriting systems gained prominence for equational reasoning and automated theorem proving, the property was generalized to arbitrary ARS, decoupling it from specific syntactic structures like \lambda-terms and applying it to broader relational frameworks.^[14] A high-level proof of the Church-Rosser property typically proceeds by first establishing a local version, where joinability holds at critical peaks formed by overlapping reductions (local Church-Rosser). This local condition then implies the global property through techniques such as standardization of reduction sequences, which ensures that any reduction can be rearranged into a standard form, or via Newman's lemma, which links local joinability to global confluence under additional assumptions like termination. These methods provide a modular way to verify the property without exhaustive case analysis. Counterexamples of non-Church-Rosser ARS illustrate the importance of the property; for instance, consider an ARS with elements \{a, b, c\} and rules a \to b, a \to c, but no further reductions from b or c. Here, b \leftrightarrow^* c via the common ancestor a, yet b and c have no common reduct, violating joinability. Such systems model phenomena like ambiguous context-free grammars, where multiple derivation paths for the same string fail to converge, leading to non-unique parses.^[13]

Notions of Confluence

In abstract rewriting systems, confluence is studied through various notions that capture the independence of reduction paths, often visualized as diamond-like properties where diverging reductions reconverge. Local confluence, also known as weak confluence, requires that for every peak configuration u \leftarrow w \to v in the system (A, \to), there exists some x \in A such that u \to^* x \leftarrow^* v.^[12] This property ensures that immediate diverging one-step reductions are joinable via finite sequences of reductions, providing a local guarantee of path independence without assuming global behavior.^[12] Global confluence extends this idea to arbitrary reduction sequences: an abstract rewriting system (A, \to) is globally confluent if for all a, b, c \in A with b \leftarrow^* a \to^* c, there exists e \in A such that b \to^* e \leftarrow^* c.^[12] This stronger condition implies that the choice of reduction order does not affect the eventual outcome, making it essential for ensuring deterministic computation in rewriting-based models.^[12] Local confluence does not necessarily imply global confluence in non-terminating systems, but it serves as a foundational criterion for further analysis.^[12] Newman's lemma establishes a key bridge between these notions, stating that if an abstract rewriting system is terminating and locally confluent, then it is globally confluent.^[16] The intuition behind this result is that termination prevents infinite reduction paths, allowing local joinability at peaks to propagate globally through no-overlap or finite descent arguments, ensuring all diverging sequences eventually meet.^[12] This lemma is pivotal in proving confluence for terminating systems, reducing the verification effort to checking local peaks.^[16] A stronger variant, strong confluence, requires that for every overlapping peak u \leftarrow w \to v \to b (where v \to b is an additional step from one branch), there exists x \in A such that u \to^* x \leftarrow^* b.^[5] This condition is stricter than local confluence, as it handles immediate overlaps directly, and implies local confluence but not vice versa.^[5] Strong confluence is particularly useful in systems with overlapping rules, providing a more robust local property that facilitates proofs of global behavior.^[5] In confluent systems that are weakly normalizing—meaning every element has at least one normal form—the unique normal form property holds: every element reduces to exactly one normal form.^[12] This follows directly from global confluence, as any two normal forms reachable from the same starting point must join, and normal forms have no further reductions.^[12] Weak normalization combined with confluence thus guarantees deterministic outcomes in applications like proof normalization or program evaluation.^[12] Modern variants integrate structural conditions for easier confluence verification; for instance, orthogonal term rewriting systems—those that are left-linear and have no critical pairs (non-overlapping left-hand sides)—are locally confluent, and thus globally confluent if terminating, by Newman's lemma.^[12] A classic example of a confluent system is the untyped lambda calculus under beta-reduction, where reductions commute via the Church-Rosser property, ensuring any two beta-normal forms from the same lambda term are convertible. In contrast, a simple non-confluent system with rules x \to a and x \to b (where a and b have no joining reductions) exhibits a peak a \leftarrow x \to b that cannot be resolved, violating even local confluence.^[12]

Termination

In an abstract rewriting system (ARS), termination, also known as strong normalization, is defined as the property that every reduction sequence starting from any element is finite, meaning there are no infinite chains of the form a \to a_1 \to a_2 \to \cdots.^[17] This ensures that reductions cannot loop indefinitely and always reach a stopping point. The reduction relation \to in a terminating ARS is Noetherian, which is equivalent to it being well-founded: there are no infinite descending chains in the relation.^[17] A common criterion for proving termination involves assigning a well-founded measure \mu to elements such that \mu(a) > \mu(b) whenever a \to b, with the measure strictly decreasing along reductions; examples include decreasing argument functions or polynomial interpretations, where terms are mapped to polynomials over natural numbers and the interpretation preserves the reduction order while ensuring the polynomials decrease.^[18] Termination has key implications for computability in ARS: it guarantees the existence of normal forms for every element, as all sequences terminate, enabling effective computation of these forms.^[17] For instance, primitive recursive functions can be encoded in terminating term rewriting systems (a subclass of ARS), where the finite reduction lengths align with the primitive recursive bounding functions, providing a foundational link between rewriting and recursive computation.^[19] In contrast, a simple non-terminating ARS is the one with a single element x and rule x \to x, which admits the infinite sequence x \to x \to x \to \cdots. In practice, ensuring termination addresses potential incompleteness in rewriting-based theorem proving; the Knuth-Bendix completion procedure, developed in the late 20th century with modern extensions incorporating automated termination checkers, uses reduction orderings to verify and maintain termination during the construction of confluent systems from equational specifications.^[20] Termination also plays a crucial role in confluence analysis, as Newman's lemma states that a weakly confluent and terminating ARS is confluent.^[17]

Convergence

In abstract rewriting systems (ARS) that do not terminate, convergence provides a framework for analyzing infinite reduction sequences by defining limits to which they may approach, even without reaching a finite normal form. A reduction sequence (a_i)_{i < \omega} in an ARS converges to a limit l if, for every element b reachable from some a_n via a finite reduction, b reduces in finitely many steps to l; this ensures that the sequence stabilizes in a manner where further finite explorations from its tail inevitably lead back to the same limit.^[21] This notion extends the finite case by treating l as an "infinite normal form," which is an element with no outgoing reductions possible from the limit itself, often modeled coinductively as the greatest fixed point of deconstruction rules in the system.^[22] Infinite normal forms arise in non-terminating ARS as coinductive terms, such as those in the set T_\omega(\Sigma) for a signature \Sigma, where terms are infinite-depth structures satisfying bisimulation with respect to the rewriting relation. In such systems, a sequence converges to an infinite normal form if it is both weakly continuous (limits at successor steps match the sequence) and the overall limit has no infinite reductions diverging from it. For instance, criteria involving accessible elements—terms with finitely defined positions in partial approximations—allow verification of convergence by checking finite approximations against compact objects in the domain. Coinductive definitions further characterize these limits as the largest sets closed under the system's rules, enabling proofs of uniqueness in orthogonal systems.^[22]^[21] Omega-confluence generalizes confluence to infinite branches in ARS, requiring that any two diverging infinite reduction paths from a common starting point reconverge to the same limit; this holds in Hausdorff topological spaces induced by the rewriting relation, ensuring unique limits for convergent sequences. In the partial order model, omega-confluence manifests as strong p-convergence, where volatile positions in the sequence stabilize to the limit under a complete semilattice ordering \leq_\perp on partial terms. This property is crucial for non-terminating yet productive computations, as in infinitary term rewriting where orthogonal systems achieve infinitary confluence via Böhm trees as unique normal forms.^[22]^[21] An illustrative example occurs in lambda calculus extended with fixpoints via the Y combinator, where the term Y(f) generates the infinite reduction Y(f) \to f(Y(f)) \to f(f(Y(f))) \to \cdots, which converges to the fixed-point limit f^\omega despite never terminating; here, f^\omega serves as an infinite normal form, as any finite subterm reduction leads back to it, modeling recursive unfolding in denotational semantics.^[23] Convergence in ARS relates to domain theory through Scott domains, where the set of partial terms T(\Sigma \sqcup \{\bot\}) forms a directed complete partial order (dcpo) under \leq_\perp, with the rewriting relation embedding as a quasi-order; limits of convergent sequences correspond to least upper bounds in this structure, and the Scott topology provides open sets for defining neighborhood-based convergence, unifying metric and partial approaches. This domain-theoretic view addresses infinite behaviors in 2020s semantics for higher-order systems, emphasizing bounded completeness for coinductive limits. Accessible elements and Cauchy criteria in induced metric spaces (e.g., ultrametrics on terms) offer decidable checks for convergence, particularly in complete spaces where sequences with redex depths tending to infinity ensure strong convergence.^[22]^[21]

References

[1]
abstract rewriting system in nLab
### Summary of Abstract Rewriting System
[2]
[PDF] My very first steps in Rewriting Theory - l'IRIF
Oct 24, 2012 · An abstract rewriting system is a set A with a binary relation →. ... In fact, this leads to the definition of an abstract rewriting system (A,→).
[3]
Abstract Properties and Applications to Term Rewriting Systems ...
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems ... First page of PDF. Formats available. You can view the full content ...
[4]
[PDF] Rewriting and Termination in Lambda Calculus
A term rewriting system (TRS) is an abstract rewriting system. (ARS) whose objects are representable as an inductively defined grammar. We call a TRS a higher- ...
[5]
[PDF] Term Rewriting Systems: a tutorial - Centrum Wiskunde & Informatica
1.1. DEFINITION. (i) An Abstract Reduction System (ARS) is a structure A= <A, (-7~aer> consisting of a set A and a sequence of binary relations -7 a on A, also ...<|control11|><|separator|>
[6]
The Lambda Calculus - Stanford Encyclopedia of Philosophy
Dec 12, 2012 · The main ideas are applying a function to an argument and forming functions by abstraction. The syntax of basic $\lambda$-calculus is quite ...Syntax · Brief history of \(\lambda... · Reduction · Consistency of the \(\lambda...<|control11|><|separator|>
[7]
Orderings for term-rewriting systems - ScienceDirect.com
Orderings for term-rewriting systems☆. Author links open overlay panel ... Dershowitz. A note on simplification orderings. Information Processing Lett ...
[8]
[PDF] Rewriting - Part 1. Abstract Reduction - RISC
▸ Abstract treatment of reductions. Page 47. Abstract Reduction Systems. ▸ Abstract reduction system (ARS): A pair (A,→), where ... reflexive transitive closure.
[9]
[PDF] Term Rewriting Systems - Centrum Wiskunde & Informatica
Already half a century ago, the A-calculus, probably the most well-known Term. Rewriting System, played a crucial role in mathematical logic with respect to ...Missing: origins | Show results with:origins
[10]
[PDF] Term Rewriting Systems - TAU
1. 1. An Abstract Reduction System (ARS) is a structure A = hA;(! ) 2Ii consisting of a set A and a sequence of binary relations ! on A, also called ...
[11]
[PDF] A Taste of Rewrite Systems - University of Iowa
Abstract. This survey of the theory and applications of rewriting with equations discusses the exis- tence and uniqueness of normal forms, the Knuth-Bendix ...Missing: history Kleene<|control11|><|separator|>
[12]
[PDF] Chapter 3 The Lambda-Calculus - Penn Engineering
β-REDUCTION AND β-CONVERSION; THE CHURCH–ROSSER THEOREM 199. Example 3.1. The ... The Church–Rosser property also holds for system F. The proof ...
[13]
Term Rewriting and All That
Term Rewriting and All That. Search within full text. Access. Franz Baader, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany.
[14]
Abstract Properties and Applications to Term Rewriting Systems
Confluent reductions in term rewriting systems mean replacements are deterministic, and the Church-Rosser property allows checking term equivalency by ...
[15]
SOME PROPERTIES OF CONVERSION*
Conversion defined by Church's Rules I, II, III. In our study of con ... ALONZO CHURCH AND J. B. ROSSER nition (see Kleene, top of p. 530) and then ...
[16]
Term rewriting systems from Church-Rosser to Knuth-Bendix and ...
Jun 27, 2005 · Abstract. Term rewriting systems are important for computability theory of abstract data types, for automatic theorem proving, and for the ...Missing: seminal | Show results with:seminal
[17]
On Theories with a Combinatorial Definition of "Equivalence" - jstor
obvious that in a theory in which the confluence theorem holds no equivalence class can contain more than one end-form, but there remains the question.
[18]
[PDF] 1 Termination and abstract reduction systems - Uppsala universitet
Oct 12, 2010 · An Abstract Reduction System (ARS) is a set A together with a binary rela- tion →. Further on we will mostly be interested in the case ...
[19]
Termination of rewriting systems by polynomial interpretations and ...
This paper describes the actual implementation in the rewrite rule laboratory REVE of an elementary procedure that checks inequalities between polynomials ...
[20]
Term rewriting theory for the primitive recursive functions
Feb 14, 1997 · We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of the facts ...
[21]
Slothrop: Knuth-Bendix completion with a modern termination checker
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and resulting rewriting systems.
[22]
[PDF] PARTIAL ORDER INFINITARY TERM REWRITING
Jun 3, 2014 · The defining core of a theory of infinitary term rewriting is its notion of convergence for transfinite reductions: which transfinite ...
[23]
[PDF] Topological Convergence in Infinitary Abstract Rewriting
Rewriting is a field on the border of logic, mathematics and theoretical computer science. It studies the stepwise transformation of objects and as such ...
[24]
[PDF] Infinitary lambda calculus
What is an infinite reduction sequence? We have spoken informally of convergent reduction sequences but not yet defined them. The obvious definition is that a ...