A-M baby

Task/Anonymous-recursion/Maple/anonymous-recursion-1.maple

@@ -0,0 +1,13 @@
+Fib := proc( n :: nonnegint )
+        proc( k )
+                option  remember; # automatically memoise
+                if k = 0 then
+                        0
+                elif k = 1 then
+                        1
+                else
+                        # Recurse, anonymously
+                        thisproc( k - 1 ) + thisproc( k - 2 )
+                end
+        end( n )
+end proc:

Task/Anonymous-recursion/Maple/anonymous-recursion-2.maple

@@ -0,0 +1,6 @@
+> seq( Fib( i ), i = 0 .. 10 );
+                  0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
+
+> Fib( -1 );
+Error, invalid input: Fib expects its 1st argument, n, to be of type
+nonnegint, but received -1