Normalization without reducibility

René David (1)

1 LAMA - Laboratoire de Mathématiques

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.

Domaines: Logique [math.LO]; Logique en informatique [cs.LO]

René David. Normalization without reducibility. Annals of Pure and Applied Logic, 2001, 107, p 121-130. ⟨hal-00384697⟩