Dynamic -> dynamic.

sdk/lib/core/set.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 /**
  * This class is the public interface of a set. A set is a collection
  * without duplicates.
  */
 abstract class Set<E> extends Collection<E> {
   factory Set() => new _HashSetImpl<E>();
@@ skipping 135 matching lines @@
   }
 
   Set map(f(E element)) {
     Set result = new Set();
     _backingMap.forEach((E key, E value) {
       result.add(f(key));
     });
     return result;
   }
 
-  Dynamic reduce(Dynamic initialValue,
-                 Dynamic combine(Dynamic previousValue, E element)) {
+  dynamic reduce(dynamic initialValue,
+                 dynamic combine(dynamic previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
   Set<E> filter(bool f(E element)) {
     Set<E> result = new Set<E>();
     _backingMap.forEach((E key, E value) {
       if (f(key)) result.add(key);
     });
     return result;
   }
@@ skipping 70 matching lines @@
   }
 
   // The entries in the set. May contain null or the sentinel value.
   List<E> _entries;
 
   // The next valid index in [_entries] or the length of [entries_].
   // If it is the length of [_entries], calling [hasNext] on the
   // iterator will return false.
   int _nextValidIndex;
 }