Characterization of typings in polymorphic type discipline
Paola Giannini, S. Ronchi Della Rocca · 2003
Polymorphic type discipline for lambda -calculus is an extension of H.B. Curry's (1969) classical functionality theory, in which types can be universally quantified. An algorithm that, given a term M, builds a set of constraints, is satisfied. Moreover, all the typings for M (if any) are built from the set of constraints by substitutions. Using the set of constraints, some properties of polymorphic type discipline are proved.>