A direct proof of the confluence of combinatory strong reduction
Résumé
I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed terms.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...