Weak orthogonality implies confluence : the higher-order case

van Oostrom, Vincent; van Raamsdonk, Femke

In this paper we prove confluence for weakly orthogonal Higher-Order Rewriting Systems. This generalises all the known `confluence by orthogonality' results.

Additional Metadata
ACM	Mathematical Logic (acm F.4.1), Studies of Program Constructs (acm F.3.3)
MSC	Theory of computing (msc 68Qxx)
Publisher	CWI
Series	Department of Computer Science [CS]
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	van Oostrom, V.& van Raamsdonk, F. (1995). Weak orthogonality implies confluence : the higher-order case. In Department of Computer Science [CS] (R 9501). CWI.

Free Full Text ( Final Version , 345kb )

Weak orthogonality implies confluence : the higher-order case

Publication

Publication

Address

CWI researchers

Questions or comments?

Weak orthogonality implies confluence : the higher-order case

Publication

Publication

Workflow

Workflow

Add Content