Ideas for improvement More formal treatment Most-specific matching? Needs lookupLessSpecific and lookupMoreSpecific.... Finding unifiers Doing non-linear matching through deferred equality constraints Polytypic derivation of matching lookup à la Hinze? Efficient fromList(With) by partitioning Implemented that, but it's slower. Perhaps It would be faster if we used a mutable array that we'd partition as we go. Somehow.

let f = {x,y,z} \ [] -> M in case q of n -> let g = {x,y,z} -> N 0 -> 0 in f into letenv xyz = env {x,y,z} in

Overall goal Extend Core so that The kind of a type expresses its arity (as well as levity and representation, which it does now). Two lambdas: one "old" lamda, and a new arity-aware one; similarly two arrow type constructors (->) and (~>). Status Shant's google doc Question: long term, do we want the RuntimeInfo structure to be a pair? Maybe yes... convenient when you want to be polymorphic in both.

Test (with a different title) sdf sdf sdfsd sldfkj lsdkj