A Proof of Strong Normalisation using Domain Theory

14 years 5 months ago

U. Berger, [11] signiﬁcantly simpliﬁed Tait’s normalisation proof for bar recursion [27], see

Thierry Coquand, Arnaud Spiwack

Computer Science | LICS 2006 | Tait’s Normalisation Proof |

claim paper

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	LICS
Authors	Thierry Coquand, Arnaud Spiwack

Comments (0)