refactoring

src/compiler/GF/Compile/TypeCheck/Concrete.hs

@@ -182,9 +182,9 @@ inferLType gr g trm = case trm of
 
    K s  ->
      let trm' = case words s of
-                  []  -> Empty
+                  []     -> Empty
-                  [w] -> K w
+                  [w]    -> K w
-                  ws  -> foldr C Empty (map K ws)
+                  (w:ws) -> foldl (\t -> C t . K) (K w) ws
      in return (trm', typeStr)
 
    EInt i -> return (trm, typeInt)