FUBS.md

@@ -63,17 +63,14 @@ We have an almost pathological focus on minimalism.  We want the functionality o
         * Boolean
       * Reference types (nullable):
         * Array
-        * Big Array (for 64 bit heaps) (not yet implemented)
         * Object (bound to a specific class)
-        * Big Object (for 64 bit heaps) (not yet implemented)
-        * Functions (including closures)
+        * Functions, Methods, Closures
     * Signedness of integer types is determined by the binary operator chosen.
-    * Type inference required for local variables.
-    * No automatic coercion except for widening of object types
+    * Stack variable types are inferred.
+    * No automatic coercion except for widening of object types.
       * Any primitive type may be cast to any other primitive type.
     * Class parameters provide for [generic programming](https://en.wikipedia.org/wiki/Generic_programming).
-      * An object type is provided to specify how wide a class parameter may be.
-  * Heap management so far:
+  * Heap management:
     * No dynamic reachability analysis except when debugging.
     * A reference type may be "prime", which means that it will be automatically freed when it leaves scope (for local variables), or its parent is freed (for object fields).
     * Static analysis will help catch program errors with respect to prime reference management.
@@ -88,6 +85,7 @@ We have an almost pathological focus on minimalism.  We want the functionality o
   * Concurrency is not yet implemented. 
   * Execution model:
     * Fully self hosted.
+       * This includes source code management.
     * Programs are stored as a binary representation of its abstract syntax tree.
     * An IDE is being developed to directly manipulate the abstract syntax tree.
     * A text format exists for bootstrapping and luddites.
\ No newline at end of file