| J-Y.Girard: Interprtation fonctionelle et limination des coupures dans l'arithmtique d'ordre suprieur, Thse de doctorat d'tat, University of Paris, 1972. |
....and in combination with quantifiers results in bounded polymorphic functions and partially abstract types. Subtyping is realized in a uniform way throughout the system via a notion of power kind, where P (A) is the kind of all subtypes of A. Formally, Quest is an extension of Girard s Fw [Girard 72] with additional kind structure, subtyping structure, recursive types, and fixpoints at all types. Alternatively, it is a higher order extension of the calculus studied in [Curien Ghelli 90] which is the kernel of the calculus in [Cardelli Wegner 85] Recursion is necessary to model programming ....
.... T 7 P (Top) the kind of all types P(X)L 7 P(X: T )L P(X :A)L 7 P(X: P (A) L P(X)B 7 P(X: T )B P(X :A)B 7 P(X: P (A) B l(X)B 7 l(X: T )B l(X :A)B 7 l(X: P (A) B l(X)b 7 l(X: T )b l(X :A)b 7 l(X: P (A) b From the abbreviations above we can see that this calculus includes all the terms of Fw [Girard 72] and Fun [Cardelli Wegner 85] Page 7 2.2 Judgments The formal rules are based on eight primitive judgment forms plus three derived ones, listed below. # E env E is an environment E # K kind K is a kind (in an environment E) E # A: K type A has kind K E # A type A is a type (abbr. for E # ....
[Article contains additional citation context not shown here]
J-Y.Girard: Interprtation fonctionelle et limination des coupures dans l'arithmtique d'ordre suprieur, Thse de doctorat d'tat, Universit Paris VII, 1972.
....and in combination with quantifiers results in boundedpolymorphic functions and partially abstract types. Subtyping is realized in a uniform way throughout the system via a notion of power kind, where P (A) is the kind of all subtypes of A. Formally, Quest is an extension of Girard s Fw [Girard 72] with additional kind structure, subtyping structure, recursive types, and fixpoints at all types. Alternatively, it is a higher order extension of the calculus studied in [Curien Ghelli 90] which is the kernel of the calculus in [Cardelli Wegner 85] Recursion is necessary to model programming ....
.... T 7 P (Top) the kind of all types P(X)L 7 P(X: T )L P(X :A)L 7 P(X: P (A) L P(X)B 7 P(X: T )B P(X :A)B 7 P(X: P (A) B l(X)B 7 l(X: T )B l(X :A)B 7 l(X: P (A) B l(X)b 7 l(X: T )b l(X :A)b 7 l(X: P (A) b From the abbreviations above we can see that this calculus includes all the terms of Fw [Girard 72] and Fun [Cardelli Wegner 85] 2.2 Judgments The formal rules are based on eight primitive judgment forms plus three derived ones, listed below. # E env E is an environment E # K kind K is a kind (in an environment E) E # A: K type A has kind K E # A type A is a type (abbr. for E # A: T ) ....
[Article contains additional citation context not shown here]
J-Y.Girard: Interprtation fonctionelle et limination des coupures dans l'arithmtique d'ordre suprieur, Thse de doctorat d'tat, Universit Paris VII, 1972.
No context found.
J-Y.Girard: Interprtation fonctionelle et limination des coupures dans l'arithmtique d'ordre suprieur, Thse de doctorat d'tat, University of Paris, 1972.
No context found.
J-Y.Girard: Interprdtation fonctionelle et aliiruination des coupures dans l'arithmdtique d'ordre supdrieur, Thse de doctorat d'6tat, University of Paris, 1972.
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