Rewriting systems on FP expressions to reduce the number of sequences yielded

This publication has 14 references indexed in Scilit:

• Completion of a set of rules modulo a set of equations
  Published by Association for Computing Machinery (ACM) ,1984
• Confluent and coherent equational term rewriting systems application to proofs in abstract data types
  Published by Springer Nature ,1983
• Orderings for term-rewriting systems
  Theoretical Computer Science, 1982
• The algebra of functional programs: Function level reasoning, linear equations, and extended definitions
  Lecture Notes in Computer Science, 1981
• Function level programs as mathematical objects
  Published by Association for Computing Machinery (ACM) ,1981
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
  Journal of the ACM, 1980
• Equations and Rewrite Rules: A Survey
  Published by Elsevier ,1980
• Can programming be liberated from the von Neumann style?
  Communications of the ACM, 1978
• A Metalanguage for interactive proof in LCF
  Published by Association for Computing Machinery (ACM) ,1978
• Compilation and delayed evaluation in APL
  Published by Association for Computing Machinery (ACM) ,1978