Combining first and higher order rewrite systems with type assignment systems

This publication has 15 references indexed in Scilit:

• 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
• Partial type assignment in left linear applicative term rewriting systems
  Published by Springer Nature ,1992
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
  International Journal of Foundations of Computer Science, 1990
• Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system
  Published by Association for Computing Machinery (ACM) ,1989
• Counterexamples to termination for the direct sum of term rewriting systems
  Information Processing Letters, 1987
• Typing and computational properties of lambda expressions
  Theoretical Computer Science, 1986
• A filter lambda model and the completeness of type assignment
  The Journal of Symbolic Logic, 1983
• Edinburgh LCF
  Lecture Notes in Computer Science, 1979
• On Theories with a Combinatorial Definition of "Equivalence"
  Annals of Mathematics, 1942