anchor.diff:  
           [<CompiledName("FindIndex")>]
           let findIndex predicate list =
  -            let rec loop n = function[] -> indexNotFound()  | h :: t -> if predicate h then n else loop (n+1) t
  +            let rec loop n list = 
  +                match list with 
  +                | [] -> indexNotFound()
  +                | h :: t -> if predicate h then n else loop (n + 1) t
  +
               loop 0 list
   
           [<CompiledName("TryFindIndex")>]
           let tryFindIndex predicate list =
  -            let rec loop n = function[] -> None | h :: t -> if predicate h then Some n else loop (n+1) t
  +            let rec loop n list = 
  +                match list with
  +                | [] -> None
  +                | h :: t -> if predicate h then Some n else loop (n + 1) t
  +
               loop 0 list
   
           [<CompiledName("FindIndexBack")>]
  
positive.code:                 acc
  
          [<CompiledName("Min")>]
          let inline min          (list:list<_>) =
              match list with
              | [] -> invalidArg "list" LanguagePrimitives.ErrorStrings.InputSequenceEmptyString
              | h :: t ->
  
negative.code:             match list with
              | [] -> invalidArg "source" LanguagePrimitives.ErrorStrings.InputSequenceEmptyString
              | xs ->
                  let mutable sum = LanguagePrimitives.GenericZero<'U>
                  let mutable count = 0
                  for x in xs do
                      sum <- Checked.(+) sum (projection x)
  