×

Principal typing in a \(\forall \wedge\)-discipline. (English) Zbl 0826.03009

Authors’ summary: We study the problem of finding a principal typing for a \(\lambda\)-term in a polymorphic intersection type assignment system. Following the approach of Coppo et al., Ronchi and Venneri, the principal type is proved to exist for any \(\lambda\)-term with a finite set of approximants. In the same way the existence of the principal type is shown for \({\mathbf B \mathbf C \mathbf K}\lambda\)-terms in a polymorphic type assignment system.
Reviewer: C.Berline (Paris)

MSC:

03B40 Combinatory logic and lambda calculus
PDFBibTeX XMLCite
Full Text: DOI