Convergent relation

Convergentdef

A relation is convergent when it is both Confluent and Terminating. Convergent rewriting systems decide their own equational theory: rewrite to normal form and compare.

def Convergent {α : Type*} (r : α → α → Prop) : Prop :=
  Confluent r ∧ Terminating r

Builds on

Confluence
Termination

import Conjectura.Defs.ComputerScience.Rewriting.Convergent · maintainer — open · raw source

Adapted for Conjectura from cslib, `Cslib/Foundations/Relation/Defs.lean`, split into one concept per module. Released by its authors under Apache 2.0.

Copyright (c) 2025 Fabrizio Montesi and Thomas Waring. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fabrizio Montesi, Thomas Waring, Chris Henson

Full credits