TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 DEF

An algorithm designed to complete a set of term-rewriting rules to have the most desired property of being confluent.  2, fiche 1, Anglais, - completion%20algorithm

Record number: 1, Textual support number: 1 CONT

As defined in universal algebra, identities are equalities of two terms: x=y. Presumably, the values of the two terms are equal for all values of variables occurring in them. A reduction order is another input to the completion algorithm provided that every identity is viewed as two candidates for rewrite rules transforming the left-hand side into the right-hand side and vice versa.  3, fiche 1, Anglais, - completion%20algorithm

Fiche 1,  Justifications,  Français

Record number: 1, Textual support number: 1 CONT

L'algorithme Knuth-Bendix est un algorithme de complétion. Il prend en entrée un ensemble d'équations qu'il va transformer en règles de réécriture.  2, fiche 1, Français, - algorithme%20de%20compl%C3%A9tion

Fiche 1,  Justifications,  Espagnol