Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Syntactical Strong Normalization of Intersection Types with Term Rewriting Rules
 

Summary: Syntactical Strong Normalization of
Intersection Types with Term Rewriting Rules
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
4th International Workshop on Higher-Order Rewriting
Paris, France
June 25, 2007
Andreas Abel (LMU Munich) Syntactical Normalization HOR'07 1 / 20
Normalization Proofs in Weak Meta-Theories
Weak systems can be shown consistent in (almost as) weak
meta-theories.
Normalization implies usually consistency.
Tait's semantical normalization proof for the simply-typed
-calculus (STL) is beyond Peano Arithmetic.
Combinatorial/arithmetical/syntactical normalization proofs for the
STL have long been known, e.g., J.J.Levy (1974), Girard, Lafont,
Taylor (1989).
But were better understood for sequent calculus (cut elimination).
No such proof is known for System F; for G®odel's T, 0-induction is

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences