New answers tagged

0

At chapter 5 of TaPL, we saw that in untyped lambda calculus. pair f s = \b . b f s fst p = p tru snd p = p fls where tru = \t. \f. t fls = \t. \f. f This definition of pair is to be typed now. Here, b takes two arguments f:F and s:S and we assume the resulting type is R. so, b : F -> S -> R b f s : R now we apply quantification to this R ...


Top 50 recent answers are included