Normalization without reducibility
David, René
HAL, hal-00384697 / Harvested from HAL
Text on HAL
In [gallier], general results (due to Coppo, Dezani and Veneri) relating properties of pure lambda terms and their typability in some systems with conjunctive types are proved in a uniform way by using the reducibility method.This paper gives a very short proof of the same results (actually, one of them is a bit stronger) using purely arithmetical methods.
Publié le : 2001-01-15
Classification:  [MATH.MATH-LO]Mathematics [math]/Logic [math.LO],  [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] 
@article{hal-00384697,
     author = {David, Ren\'e},
     title = {Normalization without reducibility},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00384697}
}

David, René. Normalization without reducibility. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00384697/