Switch to: References

Add citations

You must login to add citations.
  1. Normalization without reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.
    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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations