[Submit a comment] [RTALooP home] [Index] [Previous] [Next]  [Postscript] [PDF] [BibTeX Source] [LaTeX Source] 
Originator: Roel C. de Vrijer
Date: April 1991
Summary: Is a certain conditional rewrite system, which is a linearization of Combinatory Logic extended with surjective pairing, confluent?
Is the following semiequational conditional term rewriting system (a linearization of Combinatory Logic extended with surjective pairing) confluent:

If yes, does an effective normal form strategy exist for it? See [Kd89][dV89].
[Submit a comment] [RTALooP home] [Index] [Previous] [Next]  [Postscript] [PDF] [BibTeX Source] [LaTeX Source] 