LANGAGES D'INTERPRETATION DES SCHEMAS RECURSIFS.COUSINEAU FG; RIFFLET JM.1975; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R, INFORMAT. THEOR.; FR.; DA. 1975; VOL. 9; NO 1; PP. 21-42; BIBL. 3 REF.Article

A THEORY OF COMPLEXITY OF MONADIC RECURSION SCHEMESDIKOVSKII AJ.1981; R.A.I.R.O.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 1; PP. 67-94; ABS. FRE; BIBL. 14 REF.Article

Kinded type inference for parameteric overloadingDUGGAN, D; CORMACK, G; OPHEL, J et al.Acta informatica. 1996, Vol 33, Num 1, pp 21-68, issn 0001-5903Article