Adam Gundry introduced the Generalist’s lemma as part of his work on performing this task “in context.” An algorithm for this task generates a list of constraints in a set of expressions, then runs first-order unification to solve the constraints. Bidirectional methods (15[1])for this (15[1])task recursively perform elaboration and checking steps. Algorithm W, (15[1])developed by Damas and Milner, (15[1])performs this task in OCaml (-5[1])(“oh-camel”), which uses the (15[1])parametrically polymorphic (*) Hindley–Milner (10[1])system (10[1])to make this task easier. “Bottom-up” methods for this task use a depth-first search of the AST. It doesn’t involve a rubber duck, but the “duck” method for this task tests an object’s (10[1])methods (10[1])rather than requiring an explicit declaration. For 10 points, a Microsoft-developed alternative to JavaScript allows users (10[1])to do what task statically rather than dynamically? (10[2])■END■