The Fortress Language Specification - CiteSeerX

nonprimed types and static arguments before the termination of type inference. We abuse notation by using types to
refer to both types and static arguments when it is clear from context.
First, we annotate every expression e that is not a functional application with a fresh static variable (written here as a
superscript):
e T ′
and every functional application f(a 0 , ..., a n ) (where f is the name of a generic functional) with fresh static variables
for the instantiation of each of the functional’s static parameters as well as a superscript:
fT ′ 0, ..., T ′ m−1(a 0 , ..., a n ) T ′ m
and every functional parameter x without a declared type with fresh static variable as its declared type:
x:T ′
We say that a functional application is an outermost functional application if and only if it is not a proper subexpression
of another functional application.
For each outermost functional application:
fT ′ 0, ..., T ′ m−1(a 0 , ..., a n ) T ′ m
let fR 0 , ..., R m−1 (p 0 :S 0 , ..., p n :S n ):R m be a declaration of f. Some of the types and static parameters appearing
at the declaration might be primed static variables themselves.
Note that there may be several declarations of f due to overloading. When there are multiple declarations for f, type
inference is performed to each declaration. Only the declarations to which type inference succeed are considered for
overload resolution.
We accumulate a table of subtyping constraints as follows:
First, we add the following constraint to our table:
T ′ m