adding different recursion sample, added fragments from book's license

Author: ldemailly

InspirationLicense.txt

@@ -0,0 +1,25 @@
+------------------------------------------------------------------------------
+Some of the test code and some fragments of other code come from 
+"Writing An Interpreter In Go", are originally licensed under the
+MIT License (MIT), which follows.
+------------------------------------------------------------------------------
+
+Copyright (c) 2016-2017 Thorsten Ball
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -83,7 +83,14 @@ Status: done up to and including 4.5: ie functional int, string and boolean expr
 - [x] add >= and <= comparaison operators
 
 - [x] add comments support (line)
+   - [ ] add /* */ style
 
 - [ ] line numbers for errors (for file mode)
 
 - [x] use `func` instead of `fn` for functions
+
+- [x] figure out how to get syntax highlighting (go style closest - done thx to viulisti -> .gitattributes)
+
+- [ ] assignment to maps and arrays
+
+- [ ] for loop

apply2.gr

@@ -0,0 +1,19 @@
+// Another example (see sample.gr)
+// Variant with accumulation of result down the stack
+
+a = [ 1, 3, 5, 7]
+
+apply = func(f, a) {
+    // helper function
+    h = func(f, a, result) {
+        if (len(a) == 0) {
+            return result
+        }
+        return h(f, rest(a), result + f(first(a)))
+    }
+    h(f, a, [])
+}
+
+apply(func(x) { 2 * x }, a)
+
+// ^^^ [2, 6, 10, 14]