Sciweavers

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

9

TLCA
1993
Springer

favoriteEmaildiscussreport

129views Theoretical Computer Science» more TLCA 1993»

The Conservation Theorem revisited

13 years 8 months ago

The Conservation Theorem revisited

Download www.loria.fr

This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and we prove that any λ-term that has a βI βS-normal form is strongly β-normalizable. We show how to use this result to prove the strong normalization of diﬀerent typed λ-calculi.

Philippe de Groote

Real-time Traffic

Conservation Theorem | Strong Normalization | Structural Notion | Theoretical Computer Science | TLCA 1993 |

claim paper

Related Content

» Harringtons conservation theorem redone

» Conservation principles and action schemes in the synthesis of geometric concepts

» Event Calculus Planning Revisited

» Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams

» Revisiting the Rice Theorem of Cellular Automata

» Coxs Theorem Revisited

» Revisiting Gausss analogue of the prime number theorem for polynomials over a finite field

» Saturated models of universal theories

» Structural Operational Semantics and Modal Logic Revisited

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	TLCA
Authors	Philippe de Groote

Comments (0)