A direct proof of the confluence of combinatory strong reduction

  • Authors:

  • René David

  • Affiliations:

  • Université de Savoie, Campus Scientifique, 73376 Le Bourget du Lac, France

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

I give a proof of the confluence of combinatory strong reduction that does not use the one of @l-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.