anchor.diff:      /// the signatures of the functions we're using.
       let squareOddValuesAndAddOneComposition =
           List.filter isOdd >> List.map (square >> addOne)
  +
  +    printfn "processing %A through 'squareOddValuesAndAddOneComposition' produces: %A" numbers (squareOddValuesAndAddOneComposition numbers)
   
   
   /// Lists are ordered, immutable, singly-linked lists.  They are eager in their evaluation.
  
positive.code:         |> List.filter isOdd
          |> List.map(fun x -> x |> square |> addOne)
  
      /// Lastly, you can eliminate the need to explicitly take 'values' in as a parameter by using '>>'
      /// to compose the two core operations: filtering out even numbers, then squaring and adding one.
      /// Likewise, the 'fun x -> ...' bit of the lambda expression is also not needed, because 'x' is simply
  
negative.code:         let squares = List.map square odds
          let result = List.map addOne squares
          result
  
      printfn "processing %A through 'squareOddValuesAndAddOne' produces: %A" numbers (squareOddValuesAndAddOne numbers)
      
      /// A shorter way to write 'squareOddValuesAndAddOne' is to nest each
      /// sub-result into the function calls themselves.
  