45 Typings §type systems specified by inference rules do usually infer for a given expression a typing a pair ( ,r)  is a (non-quantified) type expression r is an environment §this allows one to assign a typing to open lambda- expressions containing references to global names l the result gives us constraints on the global environment §our type interpreter 2 has been modified so as to return a typing l the external function sem1 takes an additional argument the list of global names
{}