Adding algebraic rewriting to the untyped lambda calculus (extended abstract)

This publication has 8 references indexed in Scilit:

• Combining algebra and higher-order types
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved
  Published by Springer Nature ,1991
• On termination of the direct sum of term-rewriting systems
  Information Processing Letters, 1987
• Termination of rewriting
  Journal of Symbolic Computation, 1987
• On the Church-Rosser property for the direct sum of term rewriting systems
  Journal of the ACM, 1987
• Computable values can be classical
  Published by Association for Computing Machinery (ACM) ,1987
• Using dependent types to express modular structure
  Published by Association for Computing Machinery (ACM) ,1986
• The Church-Rosser theorem for the typed $\lambda$-calculus with surjective pairing.
  Notre Dame Journal of Formal Logic, 1981