Address Ivan's comments.

runtime/lib/array.dart

 // Copyright (c) 2012, 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.
 
 
 // TODO(srdjan): Use shared array implementation.
 class _ObjectArray<E> implements List<E> {
 
   factory _ObjectArray(int length) native "ObjectArray_allocate";
 
@@ skipping 43 matching lines @@
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
     List list = new _GrowableObjectArray<E>.withCapacity(length);
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   // Collection interface.
 
-  bool contains(E element) => Collections.contains(this, element);
+  bool contains(E element) {
+    return Collections.contains(this, element);
+  }
 
   void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Iterable mappedBy(f(E element)) => new MappedIterable<E, dynamic>(this, f);
+  Iterable mappedBy(f(E element)) {
+    return new MappedIterable<E, dynamic>(this, f);
+  }
 
   reduce(initialValue, combine(previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
-  Iterable<E> where(bool f(E element)) => new WhereIterable<E>(this, f);
+  Iterable<E> where(bool f(E element)) {
+    return new WhereIterable<E>(this, f);
+  }
 
   bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
   bool any(bool f(E element)) {
     return Collections.any(this, f);
   }
 
   bool get isEmpty {
     return this.length == 0;
   }
 
   void sort([Comparator<E> compare = Comparable.compare]) {
     _Sort.sort(this, compare);
   }
 
   int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
   int lastIndexOf(E element, [int start = null]) {
     if (start == null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<E> get iterator => new _FixedSizeArrayIterator<E>(this);
+  Iterator<E> get iterator {
+    return new _FixedSizeArrayIterator<E>(this);
+  }
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to a non-extendable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
@@ skipping 87 matching lines @@
     if (length == 0) return [];
     Arrays.rangeCheck(this, start, length);
     List list = new List<E>();
     list.length = length;
     Arrays.copy(this, start, list, 0, length);
     return list;
   }
 
   // Collection interface.
 
-  bool contains(E element) => Collections.contains(this, element);
+  bool contains(E element) {
+    return Collections.contains(this, element);
+  }
 
   void forEach(f(E element)) {
     Collections.forEach(this, f);
   }
 
-  Iterable mappedBy(f(E element)) => new MappedIterable<E, dynamic>(this, f);
+  Iterable mappedBy(f(E element)) {
+    return new MappedIterable<E, dynamic>(this, f);
+  }
 
   reduce(initialValue, combine(previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
-  Iterable<E> where(bool f(E element)) => new WhereIterable<E>(this, f);
+  Iterable<E> where(bool f(E element)) {
+    return new WhereIterable<E>(this, f);
+  }
 
   bool every(bool f(E element)) {
     return Collections.every(this, f);
   }
 
   bool any(bool f(E element)) {
     return Collections.any(this, f);
   }
 
   bool get isEmpty {
@@ skipping 11 matching lines @@
 
   int indexOf(E element, [int start = 0]) {
     return Arrays.indexOf(this, element, start, this.length);
   }
 
   int lastIndexOf(E element, [int start = null]) {
     if (start == null) start = length - 1;
     return Arrays.lastIndexOf(this, element, start);
   }
 
-  Iterator<E> get iterator => new _FixedSizeArrayIterator<E>(this);
+  Iterator<E> get iterator {
+    return new _FixedSizeArrayIterator<E>(this);
+  }
 
   void add(E element) {
     throw new UnsupportedError(
         "Cannot add to an immutable array");
   }
 
   void addLast(E element) {
     add(element);
   }
 
@@ skipping 52 matching lines @@
     if (nextPosition < _length) {
       _current = _array[nextPosition];
       _position = nextPosition;
       return true;
     }
     _position = _length;
     _current = null;
     return false;
   }
 
-  E get current => _current;
+  E get current {
+    return _current;
+  }
 }