Tools for proving inductive equalities, relative completeness, and ω-completeness

This publication has 10 references indexed in Scilit:

• On sufficient-completeness and related properties of term rewriting systems
  Acta Informatica, 1987
• Counterexamples to termination for the direct sum of term rewriting systems
  Information Processing Letters, 1987
• Proof by consistency
  Artificial Intelligence, 1987
• Partial evaluation and ω-completeness of algebraic specifications
  Theoretical Computer Science, 1986
• Semantic confluence tests and completion methods
  Information and Control, 1985
• Miranda: A non-strict functional language with polymorphic types
  Lecture Notes in Computer Science, 1985
• Abstract data types and software validation
  Communications of the ACM, 1978
• The algebraic specification of abstract data types
  Acta Informatica, 1978
• The Logic of Equality
  The American Mathematical Monthly, 1977
• The λ-calculus is ω-incomplete
  The Journal of Symbolic Logic, 1974