M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift fur Mathematishche Logik und Grundlagen der Mathematik, 27:45--58, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
....Elimination of types only occurs at term variables, and so is absorbed into the VAR rule. The restricted placement of introduction and elimination simplifies type inference, but types the same set of (untyped) terms as other intersection type systems, the set of strongly fi normalizing terms [CDCV80, CDCV81, RDRV84, vB93]. The APP rule requires each of the alternatives in the argument of an application to be a typed version of the same untyped term. This is similar to the formulation of CIL , the flow typed intermediate language being used in the Church Project [WDMT9X] 6 . Key differences are that (1) ....
M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift fur Mathematishche Logik und Grundlagen der Mathematik, 27:45--58, 1981.
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
No context found.
M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift fur Mathematishche Logik und Grundlagen der Mathematik, 27:45--58, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC