anchor.diff:  /// Functional operators on LazyLists.
   [<CompilationRepresentation(CompilationRepresentationFlags.ModuleSuffix)>]
   module LazyList =
  +    //open OptimizedClosures
  +
       /// The empty LazyList.
       [<GeneralizableValue>]
       [<CompiledName("Empty")>]
  
positive.code: 
  namespace ExtCore.Collections
  
  open System
  open System.Collections.Generic
  open LanguagePrimitives
  open OptimizedClosures
  open ExtCore
  
  #nowarn "21" // recursive initialization
  #nowarn "40" // recursive initialization
  
  (* TODO :   Get rid of UndefinedException and use one of the "standard" .NET exceptions instead. *)
  (* OPTIMIZE :   The code below could likely be simplified and optimized by using System.Lazy<'T>
                  ("lazy" in F#) and Choice<_,_> instead of LazyCellStatus<'T>.
                  Basically, the Delayed and Value cases are replaced by Lazy<'T> and Choice1Of2,
  
negative.code:             else
                  match list.Value with
                  | Cons (hd, tl) ->
                      consCell hd (take (count - 1) tl)
                  | Empty ->
                      let msg = sprintf "There are not enough items in the list. (Count = %i)" count
                      invalidArg "count" msg
  