Orthogonal higher-order rewrite systems are confluent

This publication has 9 references indexed in Scilit:

• A logic programming language with lambda-abstraction, function variables, and simple unification
  Published by Springer Nature ,2005
• A logic programming approach to implementing higher-Order term rewriting
  Published by Springer Nature ,2005
• Combining algebra and higher-order types
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Higher-order critical pairs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Confluence of the lambda calculus with left-linear algebraic rewriting
  Information Processing Letters, 1992
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
  Published by Springer Nature ,1991
• Rewrite Systems
  Published by Elsevier ,1990
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
  Journal of the ACM, 1980
• Combinators, λ-Terms and Proof Theory
  Published by Springer Nature ,1972