Every unsolvable lambda-terme has a decoration
David, René
HAL, hal-00384694 / Harvested from HAL
Text on HAL
I give a proof of the conjecture stated by R.Kerth : Every unsolvable lambda term has a decoration.
Publié le : 1999-05-15
Classification:  [MATH.MATH-LO]Mathematics [math]/Logic [math.LO],  [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] 
@article{hal-00384694,
     author = {David, Ren\'e},
     title = {Every unsolvable lambda-terme has a decoration},
     journal = {HAL},
     volume = {1999},
     number = {0},
     year = {1999},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00384694}
}

David, René. Every unsolvable lambda-terme has a decoration. HAL, Tome 1999 (1999) no. 0, . http://gdmltest.u-ga.fr/item/hal-00384694/