In this chapter, we will recall several well-known results concerning confluence. First, it will be shown that confluence is in general an undecidable property of TRSs. Then we shall see that confluence is decidable for finite terminating systems. Moreover, two sufficient criteria for confluence of possibly nonterminating TRSs will be given.
KeywordsNormal Form Critical Pair Combinatory Logic Reduction Sequence Independent Position
Unable to display preview. Download preview PDF.