##
###
Developing developments

Vincent van Oostrom

1997
*
Theoretical Computer Science
*

*Confluence* results are obtained for *lambda* *calculus* *with* beta, eta and omega rules, *lambda* calculi *with* restricted expansion rules and for (first-and higher-order) term *rewriting* systems for which all ...
*The* reason why *confluence* holds in orthogonal *rewriting* systems is *the* absence *of* *the* so-called critical pairs, making that *rewrite* steps never interfere (in a destructive way) *with* *one* another. ...
To *the* *lambda* *calculus* *with* beta and eta rule, a constant I: o representing *the* completely undefined term, is added, together *with* *the* two *rewrite* rules This system has (*on* top *of* *the* trivial *ones* between ...

doi:10.1016/s0304-3975(96)00173-9
fatcat:dmhrwtsgyvel5gogpybpihkccq