Margaria, Ines; Zacchi, Maddalena Principal typing in a \(\forall \wedge\)-discipline. (English) Zbl 0826.03009 J. Log. Comput. 5, No. 3, 367-381 (1995). 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) Cited in 4 Documents MSC: 03B40 Combinatory logic and lambda calculus Keywords:lambda calculus; approximation; principal typing; polymorphic intersection type assignment; polymorphic type PDFBibTeX XMLCite \textit{I. Margaria} and \textit{M. Zacchi}, J. Log. Comput. 5, No. 3, 367--381 (1995; Zbl 0826.03009) Full Text: DOI