Combining algebra and higher-order types

@article{Tannen1988CombiningAA,
  title={Combining algebra and higher-order types},
  author={Val Tannen},
  journal={[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science},
  year={1988},
  pages={82-90}
}
The author studies the higher-order rewrite/equational proof systems obtained by adding the simply typed lambda calculus to algebraic rewrite/equational proof systems. He shows that if a many-sorted algebraic rewrite system has the Church-Rosser property, then the corresponding higher-order rewrite system which adds simply typed beta -reduction has the Church-Rossers property too. This result is relevant to parallel implementations of functional programming languages. The author also shows that… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS