Publication:3696486

zbMath0576.68002MaRDI QIDQ3696486

Hélène Kirchner, Pierre Lescanne, Claude Kirchner, Pierre Réty

Publication date: 1985

zbMATH Keywords

correctness; completeness; algorithm for solving equations in equational theories

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

68N01: General topics in the theory of software

Related Items

NARROWER, A compositional semantic basis for the analysis of equational Horn programs, Code selection by inversion of order-sorted derivors, Conditional equational theories and complete sets of transformations, Simplifying conditional term rewriting systems: Unification, termination and confluence, A class of confluent term rewriting systems and unification, History and basic features of the critical-pair/completion procedure, Narrowing vs. SLD-resolution, Enumerating outer narrowing derivations for constructor-based term rewriting systems, Narrowing based procedures for equational disunification, Schematization of infinite sets of rewrite rules generated by divergent completion processes, Three systems for cryptographic protocol analysis, Basic narrowing revisited, Kernel-LEAF: A logic plus functional language, Unification modulo an equality theory for equational logic programming, Logic and functional programming by retractions

Uses Software

• REVE