System F

(redirected from Polymorphic Lambda Calculus)
References in periodicals archive ?
1989], the polymorphic lambda calculus [Reynolds 1974].
The static semantics are derived from the regular polymorphic lambda calculus with a few twists to account for our different style of tracking type information.
The net effect of our design decisions is that we can faithfully embed the polymorphic lambda calculus (shown in Figure 21) into this new language by simply decorating the term with a single color.
Suppose [Gamma] [assertion sign] e: [Tau] in the polymorphic lambda calculus and [Gamma] is a map from source variables to target variables where Dom([Gamma]) = Dom([Gamma]).
We can erase this extended multiagent calculus (excluding fix) to the polymorphic lambda calculus by extending our definition of erasure to include the new terms.
This lemma lets us establish a correspondence between the polymorphic lambda calculus and its translation into our multiagent setting.
If 0 [assertion sign] e : [Tau] in the polymorphic lambda calculus, then erase(C ?
Suppose 0 [assertion sign] e : [Tau] is a term of the polymorphic lambda calculus, e ?
Pitts [1996] has studied relational properties on recursively defined domains and investigated parametricity in extensions of the polymorphic lambda calculus that include fixpoint recursion [Pitts 2000].
Full browser ?