Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

LICS
2006
IEEE

favoriteEmaildiscussreport

90views Automated Reasoning» more LICS 2006»

A Proof of Strong Normalisation using Domain Theory

13 years 10 months ago

A Proof of Strong Normalisation using Domain Theory

Download arnaud.spiwack.free.fr

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

Thierry Coquand, Arnaud Spiwack

Real-time Traffic

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

claim paper

Related Content

» A Strongly Normalising CurryHoward Correspondence for IZF Set Theory

» A domain model characterising strong normalisation

» Strong Normalisation for a Gentzenlike CutElimination Procedure

» Strongly Normalising CutElimination with Strict Intersection Types

» The Theory of Calculi with Explicit Substitutions Revisited

» Superdeduction at Work

» A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

» A Compiler for Rewrite Programs in AssociativeCommutative Theories

» Principles of Superdeduction

Post Info
More Details (n/a)

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

Comments (0)