Anonymous user
Anonymous recursion: Difference between revisions
m
→{{header|Elena}}
(→{{header|Kotlin}}: Updated example see https://github.com/dkandalov/rosettacode-kotlin for details) |
imported>Arakov |
||
| (115 intermediate revisions by 55 users not shown) | |||
Line 18:
;Task:
If possible, demonstrate this by writing the recursive version of the fibonacci function (see [[Fibonacci sequence]]) which checks for a negative argument before doing the actual recursion.
;Related tasks:
:* [[Y combinator]]
<br><br>
=={{header|11l}}==
{{trans|C++}}
<syntaxhighlight lang="11l">F fib(n)
F f(Int n) -> Int
I n < 2
R n
R @f(n - 1) + @f(n - 2)
R f(n)
L(i) 0..20
print(fib(i), end' ‘ ’)</syntaxhighlight>
{{out}}
<pre>
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765
</pre>
=={{header|Ada}}==
Line 24 ⟶ 43:
Better would be to use type Natural instead of Integer, which lets Ada do the magic of checking the valid range.
<
function Actual_Fib (N: in Integer) return Integer is
begin
Line 39 ⟶ 58:
return Actual_Fib (X);
end if;
end Fib;</
=={{header|ALGOL 68}}==
{{Trans|Ada}}
<
IF x < 0
THEN
Line 58 ⟶ 77:
actual fibonacci( x )
FI;
</syntaxhighlight>
=={{header|APL}}==
APL has the symbol <code>∇</code> which calls the current function recursively.
Functions can be defined and then called in place without ever assigning them a name,
though they are not quite first-class objects (you can't have an array of functions for example).
<syntaxhighlight lang="apl">fib←{ ⍝ Outer function
⍵<0:⎕SIGNAL 11 ⍝ DOMAIN ERROR if argument < 0
{ ⍝ Inner (anonymous) function
⍵<2:⍵
(∇⍵-1)+∇⍵-2 ⍝ ∇ = anonymous recursive call
}⍵ ⍝ Call function in place
}</syntaxhighlight>
=={{header|AppleScript}}==
<syntaxhighlight lang="applescript">on fibonacci(n) -- "Anonymous recursion" task.
-- For the sake of the task, a needlessly anonymous local script object containing a needlessly recursive handler.
-- The script could easily (and ideally should) be assigned to a local variable.
script
property one : 1
property sequence : {}
on f(n)
if (n < 2) then
set end of my sequence to 0
if (n is 1) then set end of my sequence to one
else
f(n - 1)
set end of my sequence to (item -2 of my sequence) + (end of my sequence)
end if
end f
end script
-- Don't insert any additional code here!
-- Sort out whether the input's positive or negative and tell the object generated above to do the recursive business.
tell result
if (n < 0) then
set its one to -1
set n to -n
end if
f(n)
return its sequence
end tell
end fibonacci
fibonacci(15) --> {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610}
fibonacci(-15) --> {0, -1, -1, -2, -3, -5, -8, -13, -21, -34, -55, -89, -144, -233, -377, -610}</syntaxhighlight>
Or, as the recursion of an anonymous declarative function, enabled by the Y combinator:
<syntaxhighlight lang="applescript">------------ ANONYMOUS RECURSION WITH THE Y-COMBINATOR --------
on run
--------------------- FIBONACCI EXAMPLE -------------------
script
on |λ|(f)
script
on |λ|(n)
if 0 > n then return missing value
if 0 = n then return 0
if 1 = n then return 1
(f's |λ|(n - 2)) + (f's |λ|(n - 1))
end |λ|
end script
end |λ|
end script
unlines(map(showList, chunksOf(12, ¬
map(|Y|(result), enumFromTo(-2, 20)))))
end run
------------------------ Y COMBINATOR ----------------------
on |Y|(f)
script
on |λ|(y)
script
on |λ|(x)
y's |λ|(y)'s |λ|(x)
end |λ|
end script
f's |λ|(result)
end |λ|
end script
result's |λ|(result)
end |Y|
----------- GENERIC FUNCTIONS FOR TEST AND DISPLAY ---------
-- chunksOf :: Int -> [a] -> [[a]]
on chunksOf(k, xs)
script
on go(ys)
set ab to splitAt(k, ys)
set a to item 1 of ab
if {} ≠ a then
{a} & go(item 2 of ab)
else
a
end if
end go
end script
result's go(xs)
end chunksOf
-- enumFromTo :: Int -> Int -> [Int]
on enumFromTo(m, n)
if n < m then
set d to -1
else
set d to 1
end if
set lst to {}
repeat with i from m to n by d
set end of lst to i
end repeat
return lst
end enumFromTo
-- intercalate :: String -> [String] -> String
on intercalate(delim, xs)
set {dlm, my text item delimiters} to ¬
{my text item delimiters, delim}
set s to xs as text
set my text item delimiters to dlm
s
end intercalate
-- map :: (a -> b) -> [a] -> [b]
on map(f, xs)
tell mReturn(f)
set lng to length of xs
set lst to {}
repeat with i from 1 to lng
set end of lst to |λ|(item i of xs, i, xs)
end repeat
return lst
end tell
end map
-- Lift 2nd class handler function into 1st class script wrapper
-- mReturn :: Handler -> Script
on mReturn(f)
if class of f is script then
f
else
script
property |λ| : f
end script
end if
end mReturn
-- showList :: [a] -> String
on showList(xs)
intercalate(", ", map(my str, xs))
end showList
-- splitAt :: Int -> [a] -> ([a], [a])
on splitAt(n, xs)
if n > 0 and n < length of xs then
if class of xs is text then
{items 1 thru n of xs as text, ¬
items (n + 1) thru -1 of xs as text}
else
{items 1 thru n of xs, items (n + 1) thru -1 of xs}
end if
else
if n < 1 then
{{}, xs}
else
{xs, {}}
end if
end if
end splitAt
-- str :: a -> String
on str(x)
x as string
end str
-- unlines :: [String] -> String
on unlines(xs)
-- A single string formed by the intercalation
-- of a list of strings with the newline character.
set {dlm, my text item delimiters} to ¬
{my text item delimiters, linefeed}
set s to xs as text
set my text item delimiters to dlm
s
end unlines</syntaxhighlight>
{{Out}}
<pre>missing value, missing value, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34
55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765</pre>
=={{header|Arturo}}==
{{trans|Nim}}
<syntaxhighlight lang="rebol">fib: function [x][
; Using scoped function fibI inside fib
fibI: function [n][
(n<2)? -> n -> add fibI n-2 fibI n-1
]
if x < 0 -> panic "Invalid argument"
return fibI x
]
loop 0..4 'x [
print fib x
]</syntaxhighlight>
{{out}}
<pre>0
1
1
2
3</pre>
=={{header|AutoHotkey}}==
<
nold1 := 1
nold2 := 0
Line 83 ⟶ 336:
}
Return t
}</
=={{header|AutoIt}}==
<syntaxhighlight lang="autoit">
ConsoleWrite(Fibonacci(10) & @CRLF) ; ## USAGE EXAMPLE
ConsoleWrite(Fibonacci(20) & @CRLF) ; ## USAGE EXAMPLE
ConsoleWrite(Fibonacci(30)) ; ## USAGE EXAMPLE
Func Fibonacci($number)
If $number < 0 Then Return "Invalid argument" ; No negative numbers
If $number < 2 Then ; If $number equals 0 or 1
Return $number ; then return that $number
Else ; Else $number equals 2 or more
Return Fibonacci($number - 1) + Fibonacci($number - 2) ; FIBONACCI!
EndIf
EndFunc
</syntaxhighlight>
{{out}}
<pre>
55
6765
832040
</pre>
=={{header|Axiom}}==
Using the Aldor compiler in Axiom/Fricas:
<
Z ==> Integer;
fib(x:Z):Z == {
Line 93 ⟶ 371:
f(n:Z,v1:Z,v2:Z):Z == if n<2 then v2 else f(n-1,v2,v1+v2);
f(x,1,1);
}</
<
Z ==> Integer
TestPackage : with
Line 103 ⟶ 381:
f : Reference((Z,Z,Z) -> Z) := ref((n, v1, v2) +-> 0)
f() := (n, v1, v2) +-> if n<2 then v2 else f()(n-1,v2,v1+v2)
f()(x,1,1)</
=={{header|
==={{header|BaCon}}===
<syntaxhighlight lang="freebasic">
DEF FN fib(x) = FIB(x)
'============================
FUNCTION FIB(int n) TYPE int
'============================
IF n < 2 THEN
PRINT n
ELSE
n1 = 0
n2 = 1
FOR i = 1 TO n
sum = n1 + n2
n1 = n2
n2 = sum
NEXT
PRINT n1
END IF
END FUNCTION
'--- less than 2
FIB(0)
FIB(1)
'--- greater than or equal to 2
FIB(2)
FIB(3)
FIB(4)
FIB(5)
FIB(6)
FIB(7)
FIB(8)
FIB(9)
'--- using an alias
'fib(9)
</syntaxhighlight>
==={{header|BASIC256}}===
{{trans|AutoIt}}
<syntaxhighlight lang="basic256">print Fibonacci(20)
print Fibonacci(30)
print Fibonacci(-10)
print Fibonacci(10)
end
function Fibonacci(num)
if num < 0 then
print "Invalid argument: ";
return num
end if
if num < 2 then
return num
else
return Fibonacci(num - 1) + Fibonacci(num - 2)
end If
end function</syntaxhighlight>
{{out}}
<pre>6765
832040
Invalid argument: -10
55</pre>
==={{header|Chipmunk Basic}}===
{{works with|Chipmunk Basic|3.6.4}}
<syntaxhighlight lang="qbasic">100 cls
110 sub fib(num)
120 if num < 0 then print "Invalid argument: "; : fib = num
130 if num < 2 then fib = num else fib = fib(num-1)+fib(num-2)
140 end sub
190 print fib(20)
200 print fib(30)
210 print fib(-10)
220 print fib(10)
230 end</syntaxhighlight>
{{out}}
<pre>Same as BASIC256 entry.</pre>
==={{header|BBC BASIC}}===
{{works with|BBC BASIC for Windows}}
This works by finding a pointer to the 'anonymous' function and calling it indirectly:
<
END
DEF FNfib(n%) IF n%<0 THEN ERROR 100, "Must not be negative"
LOCAL P% : P% = !384 + LEN$!384 + 4 : REM Function pointer
(n%) IF n%<2 THEN = n% ELSE = FN(^P%)(n%-1) + FN(^P%)(n%-2)</
{{out}}
<pre>
55
</pre>
==={{header|IS-BASIC}}===
<syntaxhighlight lang="is-basic">100 PROGRAM "Fibonacc.bas"
110 FOR I=0 TO 10
120 PRINT FIB(I);
130 NEXT
140 DEF FIB(K)
150 SELECT CASE K
160 CASE IS<0
170 PRINT "Negative parameter to Fibonacci.":STOP
180 CASE 0,1
190 LET FIB=K
200 CASE ELSE
210 LET FIB=FIB(K-1)+FIB(K-2)
220 END SELECT
230 END DEF </syntaxhighlight>
=={{header|Bracmat}}==
===lambda 'light'===
The first solution uses macro substitution. In an expression headed by an apostrophe operator with an empty lhs all subexpressions headed by a dollar operator with empty lhs are replaced by the values that the rhs are bound to, without otherwise evaluating the expression. Example: if <code>(x=7) & (y=4)</code> then <code>'($x+3+$y)</code> becomes <code>=7+3+4</code>. Notice that the solution below utilises no other names than <code>arg</code>, the keyword that always denotes a function's argument. The test for negative or non-numeric arguments is outside the recursive part. The function fails if given negative input.
<
=
. !arg:#:~<0
Line 140 ⟶ 518:
$ 30
)
</syntaxhighlight>
Answer:
<pre>832040</pre>
===pure lambda calculus===
(See http://en.wikipedia.org/wiki/Lambda_calculus). The following solution works almost the same way as the previous solution, but uses lambda calculus
<
' ( x
. $x:#:~<0
Line 165 ⟶ 543:
)
$ 30
)</
Answer:
<pre>832040</pre>
=={{header|BQN}}==
<code>𝕊</code> is a useful symbol in BQN which references the function it is currently in. This can be used to perform anonymous recursion without the need of naming the function block.
The following code calls an anonymous recursive Fibonacci function on each number of the range 0-9.
<syntaxhighlight lang="bqn">{
(𝕩<2)◶⟨+´𝕊¨,𝕏⟩𝕩-1‿2
}¨↕10</syntaxhighlight>
<syntaxhighlight lang="bqn">⟨ 0 1 1 2 3 5 8 13 21 34 ⟩</syntaxhighlight>
[https://mlochbaum.github.io/BQN/try.html#code=ewogICjwnZWpPDIp4pe24p+oK8K08J2VisKoLPCdlY/in6nwnZWpLTHigL8yCn3CqOKGlTEw Try It!]
Recursion can also be performed using an internal name defined by a header such as <code>Fact:</code> or <code>Fact 𝕩:</code>. This header is visible inside the block but not outside of it, so from the outside the function is anonymous. The named form allows the outer function to be called within nested blocks, while <code>𝕊</code> can only refer to the immediately containing one.
<syntaxhighlight lang="bqn">{Fact 𝕩:
(𝕩<2)◶⟨+´Fact¨,𝕏⟩𝕩-1‿2
}¨↕10</syntaxhighlight>
=={{header|C}}==
Using scoped function fib_i inside fib, with GCC (required version 3.2 or higher):
<
long fib(long x)
Line 199 ⟶ 593:
return 0;
}</
{{out}}
<pre>Bad argument: fib(-1)
Line 209 ⟶ 603:
calling fib_i from outside fib:
This is not the fib you are looking for</pre>
Recursive functions can be defined within [https://gcc.gnu.org/onlinedocs/gcc/Statement-Exprs.html statement expressions]:
<syntaxhighlight lang="c">
#include <stdio.h>
int main(){
int n = 3;
printf("%d",({
int fib(int n){
if (n <= 1)
return n;
return fib(n-1) + fib(n-2);
}
fib(n);
}));
return 0;
}
</syntaxhighlight>
=={{header|C sharp|C#}}==
The inner recursive function (delegate/lambda) has to be named.
<syntaxhighlight lang="csharp">
static int Fib(int n)
{
if (n < 0) throw new ArgumentException("Must be non negativ", "n");
Func<int, int> fib = null; // Must be known, before we can assign recursively to it.
fib = p => p > 1 ? fib(p - 2) + fib(p - 1) : p;
return fib(n);
}
</syntaxhighlight>
=={{header|C++}}==
In C++ (as of the 2003 version of the standard, possibly earlier), we can declare class within a function scope. By giving that class a public static member function, we can create a function whose symbol name is only known to the function in which the class was derived.
<
{
if(n < 0)
Line 237 ⟶ 662:
return actual_fib::calc(n);
}
}</
{{works with|C++11}}
<
using namespace std;
Line 254 ⟶ 679:
return actual_fib(n);
}</
Using a local function object that calls itself using <code>this</code>:
<
{
if(n < 0)
Line 266 ⟶ 691:
else
{
struct
{
double operator()(double n)
Line 279 ⟶ 704:
}
}
} actual_fib;
return actual_fib
}
}</
=={{header|Clio}}==
Simple anonymous recursion to print from 9 to 0.
<syntaxhighlight lang="clio">10 -> (@eager) fn n:
if n:
n - 1 -> print -> recall</syntaxhighlight>
=={{header|Clojure}}==
The JVM as of now has no Tail call optimization so the default way of looping in Clojure uses anonymous recursion so not to be confusing.
<
(defn fib [n]
(when (neg? n)
Line 307 ⟶ 726:
v2
(recur (dec n) v2 (+ v1 v2)))))
</syntaxhighlight>
Using an anonymous function
=={{header|CoffeeScript}}==
<
# function call itself.
fibonacci = (n) ->
Line 328 ⟶ 747:
recurse(n-2) + recurse(n-1)
recurse(n)
</syntaxhighlight>
=={{header|Common Lisp}}==
Line 335 ⟶ 754:
This version uses the anaphoric <code>lambda</code> from [http://dunsmor.com/lisp/onlisp/onlisp_18.html Paul Graham's On Lisp].
<
`(labels ((self ,parms ,@body))
#'self))</
The Fibonacci function can then be defined as
<
(assert (>= n 0) nil "'~a' is a negative number" n)
(funcall
Line 348 ⟶ 767:
n
(+ (self (- n 1)) (self (- n 2)))))
n))</
===Using labels===
Line 354 ⟶ 773:
This puts a function in a local label. The function is not anonymous, but not only is it local, so that its name does not pollute the global namespace, but the name can be chosen to be identical to that of the surrounding function, so it is not a newly invented name
<
"Fibonacci sequence function."
(if (< number 0)
Line 362 ⟶ 781:
a
(fib (- n 1) b (+ a b)))))
(fib number 0 1))))</
Although name space polution isn't an issue, in recognition of the obvious convenience of anonymous recursive helpers, here is another solution: add the language feature for anonymously recursive blocks: the operator RECURSIVE, with a built-in local operator RECURSE to make recursive calls.
Here is <code>fib</code> rewritten to use RECURSIVE:
<
"Fibonacci sequence function."
(if (< number 0)
Line 373 ⟶ 792:
(if (= n 0)
a
(recurse (- n 1) b (+ a b))))))</
Implementation of RECURSIVE:
<
(let ((hidden-name (gensym "RECURSIVE-")))
`(macrolet ((recurse (&rest args) `(,',hidden-name ,@args)))
(labels ((,hidden-name (,@(mapcar #'first parm-init-pairs)) ,@body))
(,hidden-name ,@(mapcar #'second parm-init-pairs))))))</
RECURSIVE works by generating a local function with LABELS, but with a machine-generated unique name. Furthermore, it provides syntactic sugar so that the initial call to the recursive function takes place implicitly, and the initial values are specified using LET-like syntax. Of course, if RECURSIVE blocks are nested, each RECURSE refers to its own function. There is no way for an inner RECURSIVE to specify recursion to an other RECURSIVE. That is what names are for!
Line 390 ⟶ 809:
===Using the Y combinator===
<
(symbol-function '!!) (symbol-function 'apply))
Line 453 ⟶ 872:
(1 1)
(otherwise (+ (fib (- n 1))
(fib (- n 2))))))</
=={{header|D}}==
<
assert(arg >= 0);
Line 469 ⟶ 888:
39.fib.writeln;
}</
{{out}}
<pre>63245986</pre>
Line 475 ⟶ 894:
===With Anonymous Class===
In this version anonymous class is created, and by using opCall member function, the anonymous class object can take arguments and act like an anonymous function. The recursion is done by calling opCall inside itself.
<
int fib(in int n) pure nothrow {
Line 492 ⟶ 911:
void main() {
writeln(fib(39));
}</
The output is the same.
=={{header|Dylan}}==
This puts a function in a local method binding. The function is not anonymous, but the name fib1 is local and never pollutes the outside namespace.
<syntaxhighlight lang="dylan">
define function fib (n)
when (n < 0)
error("Can't take fibonacci of negative integer: %d\n", n)
end;
local method fib1 (n, a, b)
if (n = 0)
a
else
fib1(n - 1, b, a + b)
end
end;
fib1(n, 0, 1)
end
</syntaxhighlight>
=={{header|Déjà Vu}}==
===With Y combinator===
<
labda y:
labda:
Line 514 ⟶ 952:
for j range 0 10:
!print fibo j</
===With <code>recurse</code>===
<
n 0 1
labda times back-2 back-1:
Line 530 ⟶ 968:
for j range 0 10:
!print fibo-2 j</
Note that this method starts from 0, while the previous starts from 1.
=={{header|
<syntaxhighlight lang="delphi">
program AnonymousRecursion;
{$APPTYPE CONSOLE}
uses
SysUtils;
function Fib(X: Integer): integer;
function DoFib(N: Integer): Integer;
begin
if N < 2 then Result:=N
else Result:=DoFib(N-1) + DoFib(N-2);
begin
if X < 0 then raise Exception.Create('Argument < 0')
else Result:=DoFib(X);
end;
var I: integer;
begin
for I:=-1 to 15 do
begin
try
WriteLn(I:3,' - ',Fib(I):3);
except WriteLn(I,' - Error'); end;
end;
WriteLn('Hit Any Key');
ReadLn;
end.
</syntaxhighlight>
{{out}}
<pre>
-1 - -1 - Error
0 - 0
1 - 1
2 - 1
3 - 2
4 - 3
5 - 5
6 - 8
7 - 13
8 - 21
9 - 34
10 - 55
11 - 89
12 - 144
13 - 233
14 - 377
15 - 610
Hit Any Key
</pre>
=={{header|EchoLisp}}==
A '''named let''' provides a local lambda via a label.
<
(define (fib n)
(let _fib ((a 1) (b 1) (n n))
Line 561 ⟶ 1,039:
(<= n 1) a
(_fib b (+ a b) (1- n)))))
</syntaxhighlight>
=={{header|Ela}}==
Using fix-point combinator:
<
| else = fix (\f n -> if n < 2 then n else f (n - 1) + f (n - 2)) n</
Function 'fix' is defined in standard Prelude as follows:
<
=={{header|Elena}}==
ELENA 6.x:
<syntaxhighlight lang="elena">import extensions;
fib(n)
{
if (n < 0)
{ InvalidArgumentException.raise() };
^ (n) {
if (n > 1)
{
^ this self(n - 2) + (this self(n - 1))
}
else
{
^ n
}
}(n)
}
public program()
{
for (int i := -1; i <= 10; i += 1)
{
console.print("fib(",i,")=");
try
{
console.printLine(fib(i))
}
catch(Exception e)
{
console.printLine("invalid")
}
};
console.readChar()
}</syntaxhighlight>
{{out}}
<pre>
fib(-1)=invalid
fib(0)=0
fib(1)=1
fib(2)=1
fib(3)=2
fib(4)=3
fib(5)=5
fib(6)=8
fib(7)=13
fib(8)=21
fib(9)=34
fib(10)=55
</pre>
=={{header|Elixir}}==
With Y-Combinator:
<syntaxhighlight lang="elixir">
fib = fn f -> (
fn x -> if x == 0, do: 0, else: (if x == 1, do: 1, else: f.(x - 1) + f.(x - 2)) end
Line 586 ⟶ 1,118:
IO.inspect y.(&(fib.(&1))).(40)
</syntaxhighlight>
{{out}}
102334155
=={{header|
<syntaxhighlight lang="emal">
fun fibonacci = int by int n
if n < 0 do
logLine("Invalid argument: " + n) # logs on standard error
return -1 ^| it should be better to raise an error,
| but the task is about recursive functions
end
fun actualFibonacci = int by int
return when(n < 2, n, actualFibonacci(n - 1) + actualFibonacci(n - 2))
end
return actualFibonacci(n)
end
writeLine("F(0) = " + fibonacci(0))
writeLine("F(20) = " + fibonacci(20))
writeLine("F(-10) = " + fibonacci(-10))
writeLine("F(30) = " + fibonacci(30))
writeLine("F(10) = " + fibonacci(10))
</syntaxhighlight>
{{out}}
<pre>
F(0) = 0
F(20) =
Invalid argument: -10
F(-10) = -1
F(30) = 832040
F(10) = 55
</pre>
=={{header|Erlang}}==
Two solutions. First fib that use the module to hide its helper. The helper also is called fib so there is no naming problem. Then fib_internal which has the helper function inside itself.
<syntaxhighlight lang="erlang">
-module( anonymous_recursion ).
-export( [fib/1, fib_internal/1] ).
Line 649 ⟶ 1,173:
fib( N, Next, Acc ) -> fib( N - 1, Acc+Next, Next ).
</syntaxhighlight>
=={{header|F Sharp|F#}}==
Line 655 ⟶ 1,179:
The function 'fib2' is only visible inside the 'fib' function.
<
| n when n < 0 -> None
| n -> let rec fib2 = function
| 0 | 1 -> 1
| n -> fib2 (n-1) + fib2 (n-2)
in Some (fib2 n)</
'''Using a fixed point combinator:'''
<
let fib = function
| n when n < 0 -> None
| n -> Some (fix (fun f -> (function | 0 | 1 -> 1 | n -> f (n-1) + f (n-2))) n)</
{{out}}
Both functions have the same output.
<
[null; Some 1; Some 1; Some 2; Some 3; Some 5; Some 8]</
=={{header|Factor}}==
Line 706 ⟶ 1,200:
To achieve anonymous recursion, this solution has a recursive quotation.
<
IN: rosettacode.fibonacci.ar
Line 717 ⟶ 1,211:
[ [ 2 - ] dip dup call ] 2bi +
] if
] dup call( n q -- m ) ;</
The name ''q'' in the stack effect has no significance; <code>call( x x -- x )</code> would still work.
Line 727 ⟶ 1,221:
=={{header|Falcon}}==
Falcon allows a function to refer to itself by use of the fself keyword which is always set to the currently executing function.
<
if x < 0
raise ParamError(description|"Negative argument invalid", extra|"Fibbonacci sequence is undefined for negative numbers")
Line 751 ⟶ 1,245:
catch in e
> e
end</
{{out}}
<pre>
Line 763 ⟶ 1,257:
"/home/uDTVwo/prog.fam" prog.__main__:22(PC:132)
</pre>
=={{header|FBSL}}==
<syntaxhighlight lang="qbasic">#APPTYPE CONSOLE
FUNCTION Fibonacci(n)
IF n < 0 THEN
RETURN "Nuts!"
ELSE
RETURN Fib(n)
END IF
FUNCTION Fib(m)
IF m < 2 THEN
Fib = m
ELSE
Fib = Fib(m - 1) + Fib(m - 2)
END IF
END FUNCTION
END FUNCTION
PRINT Fibonacci(-1.5)
PRINT Fibonacci(1.5)
PRINT Fibonacci(13.666)
PAUSE</syntaxhighlight>
'''Output:'''
Nuts!
1.5
484.082
Press any key to continue...
=={{header|Forth}}==
Recursion is always anonymous in Forth, allowing it to be used in anonymous functions. However, definitions can't be defined during a definition (there are no 'local functions'), and the data stack can't be portably used to get data into a definition being defined.
{{works with|SwiftForth}} - and any Forth in which colon-sys consumes zero cells on the data stack.
<
dup 2 < ?exit
1- dup recurse swap 1- recurse + ; ( xt )
Line 773 ⟶ 1,297:
: fib ( +n -- n' )
dup 0< abort" Negative numbers don't exist."
[ ( xt from the :NONAME above ) compile, ] ;</
Portability is achieved with a once-off variable (or any temporary-use space with a constant address - i.e., not PAD):
<
variable pocket pocket !
: fib ( +n -- n' )
dup 0< abort" Negative numbers don't exist."
[ pocket @ compile, ] ;</
Currently, most Forths have started to support embedded definitions (shown here for iForth):
<
dup 0< abort" Negative numbers don't exist"
[: dup 2 < ?exit 1- dup MYSELF swap 1- MYSELF + ;] execute . ;</
=={{header|Fortran}}==
Since a hidden named function instead of an anonymous one seems to be ok with implementors, here is the Fortran version:
<
integer, intent(in) :: n
if (n < 0 ) then
Line 804 ⟶ 1,328:
end if
end function purefib
end function fib</
=={{header|FreeBASIC}}==
Line 810 ⟶ 1,334:
However, for compatibility with old QB code, gosub can be used if one specifies the 'fblite', 'qb' or 'deprecated dialects:
<
#Lang "fblite"
Line 851 ⟶ 1,375:
Print
Print "Press any key to quit"
Sleep</
{{out}}
Line 858 ⟶ 1,382:
1 1 2 3 5 8 13 21 34 55 89 144
</pre>
=={{header|Fōrmulæ}}==
{{FormulaeEntry|page=https://formulae.org/?script=examples/Anonymous_recursion}}
'''Solution.'''
It consists in having a local function inside the main function, so it is neither visible nor available outside. The local function is defined after the validation, so if the input is invalid, neither the definition nor its invocation is performed.
[[File:Fōrmulæ - Anonymous recursion 01.png]]
'''Test cases'''
[[File:Fōrmulæ - Anonymous recursion 02.png]]
[[File:Fōrmulæ - Anonymous recursion 03.png]]
=={{header|Go}}==
===Y combinator===
Y combinator solution. Go has no special support for anonymous recursion.
<
import "fmt"
Line 899 ⟶ 1,440:
func yc(f ff) fn {
return func(x fx) fn {
return
}(func(x fx) fn {
return f(func(a1, a2, a3 int) int {
Line 907 ⟶ 1,446:
})
})
}</
{{out}}
<pre>
Line 919 ⟶ 1,458:
fib 40 = 102334155
fib undefined for negative numbers
</pre>
===Closure===
<syntaxhighlight lang="go">
package main
import (
"errors"
"fmt"
)
func fib(n int) (result int, err error) {
var fib func(int) int // Must be declared first so it can be called in the closure
fib = func(n int) int {
if n < 2 {
return n
}
return fib(n-1) + fib(n-2)
}
if n < 0 {
err = errors.New("negative n is forbidden")
return
}
result = fib(n)
return
}
func main() {
for i := -1; i <= 10; i++ {
if result, err := fib(i); err != nil {
fmt.Printf("fib(%d) returned error: %s\n", i, err)
} else {
fmt.Printf("fib(%d) = %d\n", i, result)
}
}
}
</syntaxhighlight>
{{out}}
<pre>
fib(-1) returned error: negative n is forbidden
fib(0) = 0
fib(1) = 1
fib(2) = 1
fib(3) = 2
fib(4) = 3
fib(5) = 5
fib(6) = 8
fib(7) = 13
fib(8) = 21
fib(9) = 34
fib(10) = 55
</pre>
=={{header|Groovy}}==
Groovy does not explicitly support anonymous recursion. This solution is a kludgy trick that takes advantage of the "owner" scoping variable (reserved word) for closures.
<
assert it > -1
{i -> i < 2 ? i : {j -> owner.call(j)}(i-1) + {k -> owner.call(k)}(i-2)}(it)
}</
Test:
<
println fib0to20
Line 936 ⟶ 1,528:
println "KABOOM!!"
println e.message
}</
{{out}}
<pre>[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765]
Line 951 ⟶ 1,543:
We're defining a function 'real' which is only available from within the fib function.
<
fib n
| n < 0 = Nothing
Line 957 ⟶ 1,549:
where real 0 = 1
real 1 = 1
real n = real (n-1) + real (n-2)</
'''Anonymous function:'''
This uses the 'fix' function to find the fixed point of the anonymous function.
<
fib :: Integer -> Maybe Integer
fib n
| n < 0 = Nothing
| otherwise = Just $ fix (\f -> (\n -> if n > 1 then f (n-1) + f (n-2) else 1)) n</
{{out}}
Both functions provide the same output when run in GHCI.
<
[Nothing,Nothing,Nothing,Nothing,Just 1,Just 1,Just 2,Just 3,Just 5,Just 8,Just 13,Just 21,Just 34,Just 55,Just 89]</
Or, without imports (inlining an anonymous fix)
<syntaxhighlight lang="haskell">fib :: Integer -> Maybe Integer
fib n
| n < 0 = Nothing
| otherwise =
Just $
(\f ->
let x = f x
in x)
(\f n ->
if n > 1
then f (n - 1) + f (n - 2)
else 1)
n
-- TEST ----------------------------------------------------------------------
main :: IO ()
main =
print $
fib <$> [-4 .. 10] >>=
\m ->
case m of
Just x -> [x]
_ -> []</syntaxhighlight>
{{Out}}
<pre>[1,1,2,3,5,8,13,21,34,55,89]</pre>
=={{header|Icon}} and {{header|Unicon}}==
Line 979 ⟶ 1,599:
This example does accomplish the goals of hiding the procedure inside ''fib'' so that the type and value checking is outside the recursion. It also does not require an identifier to reference the inner procedure; but, it requires a local variable to remember our return point. Also, each recursion will result in the current co-expression being refreshed, essentially copied, placing a heavy demand on co-expression resources.
<
every write("fib(",a := numeric(!A),")=",fib(a))
end
Line 1,002 ⟶ 1,622:
A := if type(A) == "list" then A[1]
return (@A, A) # prime and return
end</
Some of the code requires some explaining:
* The double curly brace syntax after ''makeProc'' serves two different purposes, the outer set is used in the call to create a co-expression. The inner one binds all the expressions together as a single unit.
Line 1,011 ⟶ 1,631:
For reference, here is the non-cached version:
<
local source, i
if type(n) == "integer" & n >= 0 then
Line 1,019 ⟶ 1,639:
((i-1)@makeProc(^¤t) + (i-2)@makeProc(^¤t)) @ source
}}
end</
The performance of this second version is 'truly impressive'. And I mean that in a really bad way. By way of example, using default memory settings on a current laptop, a simple recursive non-cached ''fib'' out distanced the non-cached ''fib'' above by a factor of 20,000. And a simple recursive cached version out distanced the cached version above by a factor of 2,000.
=={{header|Io}}==
The most natural way to solve this task is to use a nested function whose scope is limited to the helper function.
<
if(x < 0, Exception raise("Negative argument not allowed!"))
fib2 := method(n,
Line 1,030 ⟶ 1,650:
)
fib2(x floor)
)</
=={{header|J}}==
Copied directly from the [[Fibonacci_sequence#J|fibonacci sequence]] task, which in turn copied from one of several implementations in an [[j:Essays/Fibonacci_Sequence|essay]] on the J Wiki:
<
Note that this is an identity function for arguments less than 1 (and 1 (and 5)).
'''Examples:'''
<
144
fibN i.31
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040</
(This implementation is doubly recursive except that results are cached across function calls.)
Line 1,050 ⟶ 1,670:
Note also http://www.jsoftware.com/pipermail/general/2003-August/015571.html which points out that the form
<
Of course, that won't work here, because we are adding two recursively obtained results where tail recursion requires that the recursive result is the final result.
-------------
See also [[Y_combinator#J|Y combinator]] but note that that approach is less efficient (has higher costs).
Also, note that J's "implicit mapping" is primitive recursive (as is arithmetic in general), and thus in some contexts a "more efficient approach to recursion".
=={{header|Java}}==
Creates an anonymous inner class to do the dirty work. While it does keep the recursive function out of the namespace of the class, it does seem to violate the spirit of the task in that the function is still named.
<
if (n < 0)
throw new IllegalArgumentException("n can not be a negative number");
return new Object() {
private long fibInner(int n) {
}
}.fibInner(n);
}</syntaxhighlight>
Another way is to use the Java Y combinator implementation (the following uses the Java 8 version for better readability).
Note that the fib method below is practically the same as that of the version above, with less fibInner.
<
@FunctionalInterface
interface SelfApplicable<OUTPUT> {
OUTPUT apply(SelfApplicable<OUTPUT> input);
}
class Utils {
public static <INPUT, OUTPUT> SelfApplicable<Function<Function<Function<INPUT, OUTPUT>, Function<INPUT, OUTPUT>>, Function<INPUT, OUTPUT>>> y() {
return y -> f -> x -> f.apply(y.apply(y).apply(f)).apply(x);
}
public static <INPUT, OUTPUT> Function<Function<Function<INPUT, OUTPUT>, Function<INPUT, OUTPUT>>, Function<INPUT, OUTPUT>> fix() {
return Utils.<INPUT, OUTPUT>y().apply(Utils.<INPUT, OUTPUT>y());
}
public static long fib(int m) {
if (m < 0)
throw new IllegalArgumentException("n can not be a negative number");
f -> n -> (n < 2) ? n : (f.apply(n - 1) + f.apply(n - 2))
).apply(m);
}
}</syntaxhighlight>
=={{header|JavaScript}}==
<
if (n < 0) { throw "Argument cannot be negative"; }
return (function(n) {
return (n < 2) ?
})(n);
}</
Note that <code>arguments.callee</code> will not be available in ES5 Strict mode. Instead, you are expected to "name" function (the name is only visible inside function however).
<
if (n < 0) { throw "Argument cannot be negative"; }
return (function fib(n) {
return (n < 2) ?
})(n);
}</
=={{header|Joy}}==
This definition is taken from "Recursion Theory and Joy" by Manfred von Thun.
<syntaxhighlight lang="joy">fib == [small] [] [pred dup pred] [+] binrec;</syntaxhighlight>
=={{header|jq}}==
The "recurse" filter supports a type of anonymous recursion, e.g. to generate a stream of integers starting at 0:
<
Also, as is the case for example with Julia, jq allows you to define an inner/nested function (in the follow example, <code>aux</code>) that is only defined within the scope of the surrounding function (here <code>fib</code>). It is thus invisible outside the function:
<
def aux: if . == 0 then 0
elif . == 1 then 1
Line 1,124 ⟶ 1,756:
if n < 0 then error("negative arguments not allowed")
else n | aux
end ;</
=={{header|Julia}}==
Julia allows you to define an inner/nested function (here, <code>aux</code>) that is only defined within the surrounding function <code>fib</code> scope.
<
if n < 0
throw(ArgumentError("negative arguments not allowed"))
Line 1,134 ⟶ 1,766:
aux(m) = m < 2 ? one(m) : aux(m-1) + aux(m-2)
aux(n)
end</
=={{header|K}}==
{{works with|Kona}}
<syntaxhighlight lang="k">fib: {:[x<0; "Error Negative Number"; {:[x<2;x;_f[x-2]+_f[x-1]]}x]}</syntaxhighlight>
{{works with|ngn/k}}:
<syntaxhighlight lang=K>fib: {:[x<0; "Error Negative Number"; {:[x<2;x;o[x-2]+o[x-1]]}x]}</syntaxhighlight>
'''Examples:'''
<
0 1 1 2 3 5 8 13 21 34
fib -1
"Error Negative Number"</
=={{header|Klingphix}}==
<syntaxhighlight lang="text">include ..\Utilitys.tlhy
:fib %f !f
%fr
[ %n !n
$n 2 <
( [$n]
[$n 1 - $fr eval $n 2 - $fr eval +] )
if
] !fr
$f 0 <
( ["Error: number is negative"]
[$f true $fr if] )
if
;
25 fib ?
msec ?
"End " input</syntaxhighlight>
=={{header|Klong}}==
<syntaxhighlight lang="k">
fib::{:[x<0;"error: negative":|x<2;x;.f(x-1)+.f(x-2)]}
</syntaxhighlight>
=={{header|Kotlin}}==
{{trans|Dylan}}
<
require(n >= 0)
fun
if (k == 0) a else
return
}
Line 1,156 ⟶ 1,820:
for (i in 0..20) print("${fib(i)} ")
println()
}</
{{out}}
Line 1,164 ⟶ 1,828:
=={{header|Lambdatalk}}==
<
1) defining a
{def fibo {lambda {:n}
{{{lambda {:f
{lambda {:f :n :a :b}
{if {< :n 0}
Line 1,173 ⟶ 1,837:
else {if {< :n 1}
then :a
else {:f :f {- :n 1} {+ :a :b} :a}}}}} :n 1 0}}}
-> fibo
2) testing:
Line 1,180 ⟶ 1,845:
{fibo 8} -> 34
{fibo 1000} -> 7.0330367711422765e+208
{S.map fibo {S.serie 1 20}}
-> 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946
We could also avoid any name and write an IIFE
{{lambda {:n}
{{{lambda {:f} {:f :f}}
{lambda {:f :n :a :b}
{if {< :n 0}
then the number must be positive!
else {if {< :n 1}
then :a
else {:f :f {- :n 1} {+ :a :b} :a}}}}} :n 1 0}}
8}
-> 34
</syntaxhighlight>
=={{header|Lang}}==
<syntaxhighlight lang="lang">
fp.fib = ($n) -> {
if($n < 0) {
throw fn.withErrorMessage($LANG_ERROR_INVALID_ARGUMENTS, n must be >= 0)
}
fp.innerFib = ($n) -> {
if($n < 2) {
return $n
}
return parser.op(fp.innerFib($n - 1) + fp.innerFib($n - 2))
}
return fp.innerFib($n)
}
</syntaxhighlight>
=={{header|Lingo}}==
Lingo does not support anonymous functions. But what comes close: you can create and instantiate an "anonymous class":
<
if n<0 then return _player.alert("negative arguments not allowed")
Line 1,197 ⟶ 1,894:
return aux.fib(n)
end</
<
-- 55</
=={{header|LOLCODE}}==
{{trans|C}}
<
HOW IZ I fib YR x
Line 1,235 ⟶ 1,932:
I IZ fib_i YR 3 MKAY
KTHXBYE</
=={{header|Lua}}==
Using a [[Y combinator]].
<
return Y(function(fibs)
Line 1,245 ⟶ 1,942:
return n < 2 and 1 or fibs(n - 1) + fibs(n - 2)
end
end)</
using a metatable (also achieves memoization)
<
self[n] = self[n-1] + self[n-2]
return self[n]
end})</
=={{header|M2000 Interpreter}}==
We can use a function in string. We can named it so the error say about "Fibonacci"
To exclude first check for negative we have to declare a function in anonymous function, which may have a name (a local name)
<syntaxhighlight lang="m2000 interpreter">
A$={{ Module "Fibonacci" : Read X :If X<0 then {Error {X<0}} Else Fib=Lambda (x)->if(x>1->fib(x-1)+fib(x-2), x) : =fib(x)}}
Try Ok {
Print Function(A$, -12)
}
If Error or Not Ok Then Print Error$
Print Function(A$, 12)=144 ' true
</syntaxhighlight>
For recursion we can use Lambda() or Lambda$() (for functions which return string) and not name of function so we can use it in a referenced function. Here in k() if we have the fib() we get an error, but with lambda(), interpreter use current function's name.
<syntaxhighlight lang="m2000 interpreter">
Function fib(x) {
If x<0 then Error "argument outside of range"
If x<2 then =x : exit
Def fib1(x)=If(x>1->lambda(x-1)+lambda(x-2), x)
=fib1(x)
}
Module CheckIt (&k()) {
Print k(12)
}
CheckIt &Fib()
Print fib(-2) ' error
</syntaxhighlight>
Using lambda function
<syntaxhighlight lang="m2000 interpreter">
fib=lambda -> {
fib1=lambda (x)->If(x>1->lambda(x-1)+lambda(x-2), x)
=lambda fib1 (x) -> {
If x<0 then Error "argument outside of range"
If x<2 then =x : exit
=fib1(x)
}
}() ' using () execute this lambda so fib get the returned lambda
Module CheckIt (&k()) {
Print k(12)
}
CheckIt &Fib()
Try {
Print fib(-2)
}
Print Error$
Z=Fib
Print Z(12)
Dim a(10)
a(3)=Z
Print a(3)(12)=144
Inventory Alfa = "key1":=Z
Print Alfa("key1")(12)=144
</syntaxhighlight>
Using a Group (object in M2000) like a function
A Group may have a name like k (which hold a unique group), or can be unnamed like item in A(4), or can be pointed by a variable (or an array item) (we can use many pointers for the same group)
<syntaxhighlight lang="m2000 interpreter">
Class Something {
\\ this class is a global function
\\ return a group with a value with one parameter
private:
\\ we can use lambda(), but here we use .fib1() as This.fib1()
fib1=lambda (x)->If(x>1->.fib1(x-1)+.fib1(x-2), x)
public:
Value (x) {
If x<0 then Error "argument outside of range"
If x<2 then =x : exit
=This.fib1(x) \\ we can omit This using .fib1(x)
}
}
K=Something() ' K is a static group here
Print k(12)=144
Dim a(10)
a(4)=Group(K)
Print a(4)(12)=144
pk->Something() ' pk is a pointer to group (object in M2000)
\\ pointers need Eval to process arguments
Print Eval(pk, 12)=144
Inventory Alfa = "Key2":=Group(k), 10*10:=pk
Print Alfa("Key2")(12)=144
Print Eval(Alfa("100"),12)=144, Eval(Alfa(100),12)=144
</syntaxhighlight>
=={{header|Maple}}==
In Maple, the keyword thisproc refers to the currently executing procedure (closure), which need not be named. The following defines a procedure Fib, which uses a recursive, anonymous (unnamed) procedure to implement the Fibonacci sequence. For better efficiency, we use Maple's facility for automatic memoisation ("option remember").
<syntaxhighlight lang="maple">
Fib := proc( n :: nonnegint )
proc( k )
Line 1,268 ⟶ 2,053:
end( n )
end proc:
</syntaxhighlight>
For example:
<syntaxhighlight lang="maple">
> seq( Fib( i ), i = 0 .. 10 );
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
Line 1,277 ⟶ 2,062:
Error, invalid input: Fib expects its 1st argument, n, to be of type
nonnegint, but received -1
</syntaxhighlight>
The check for a negative argument could be put either on the outer Fib procedure, or the anonymous inner procedure (or both). As it wasn't completely clear what was intended, I put it on Fib, which results in a slightly better error message in that it does not reveal how the procedure was actually implemented.
=={{header|Mathematica}} / {{header|Wolfram Language}}==
An anonymous reference to a function from within itself is named #0, arguments to that function are named #1,#2..#n, n being the position of the argument. The first argument may also be referenced as a # without a following number, the list of all arguments is referenced with ##. Anonymous functions are also known as [http://reference.wolfram.com/mathematica/tutorial/PureFunctions.html pure functions] in Mathematica.
<
fib := If[check[#],Throw["Negative Argument"],If[#<=1,1,#0[#-2]+#0[#-1]]&[#]]&
fib /@ Range[0,10]
{1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89}</
Making sure that the check is only performed once.
<
fib /@ Range[0,4]
0
Line 1,296 ⟶ 2,081:
4
{1, 1, 2, 3, 5}</
=={{header|MATLAB}}==
Not anonymous exactly, but using a nested function solves all the problems stated in the task description.
* does not exist outside of parent function
* does not need a new name, can reuse the parent name
* a nested function can be defined in the place where it is needed
<syntaxhighlight lang="matlab">
function v = fibonacci(n)
assert(n >= 0)
v = fibonacci(n,0,1);
% nested function
function a = fibonacci(n,a,b)
if n ~= 0
a = fibonacci(n-1,b,a+b);
end
end
end
</syntaxhighlight>
=={{header|Nemerle}}==
Line 1,303 ⟶ 2,106:
* inner function not expected to be called from anywhere else
* nesting maintains program flow in source code
<
using System.Console;
Line 1,332 ⟶ 2,135:
}
}
}</
=={{header|Nim}}==
<
proc fib(x: int): int =
proc fibI(n: int): int =
Line 1,346 ⟶ 2,149:
echo fib(i)
# fibI(10) # undeclared identifier 'fibI'</
Output:
<pre>0
Line 1,356 ⟶ 2,159:
=={{header|Objective-C}}==
This shows how a method (not regular function) can recursively call itself without explicitly putting its name in the code.
<
@interface AnonymousRecursion : NSObject { }
Line 1,387 ⟶ 2,190:
}
return 0;
}</
;With internal named recursive block:
{{works with|Mac OS X|10.6+}}
<
int fib(int n) {
Line 1,416 ⟶ 2,219:
}
return 0;
}</
When ARC is disabled, the above should be:
<
int fib(int n) {
Line 1,443 ⟶ 2,246:
}
return 0;
}</
=={{header|OCaml}}==
Line 1,452 ⟶ 2,255:
We're defining a function 'real' which is only available from within the fib function.
<
let rec real = function
0 -> 1
Line 1,461 ⟶ 2,264:
None
else
Some (real n)</
'''Anonymous function:'''
This uses the 'fix' function to find the fixed point of the anonymous function.
<
let fib n =
Line 1,472 ⟶ 2,275:
None
else
Some (fix (fun f -> fun n -> if n <= 1 then 1 else f (n-1) + f (n-2)) n)</
{{out}}
<pre># fib 8;;
- : int option = Some 34</pre>
=={{header|Ol}}==
This uses named let to create a local function (loop) that only exists inside of function fibonacci.
<syntaxhighlight lang="scheme">
(define (fibonacci n)
(if (> 0 n)
"error: negative argument."
(let loop ((a 1) (b 0) (count n))
(if (= count 0)
b
(loop (+ a b) a (- count 1))))))
(print
(map fibonacci '(1 2 3 4 5 6 7 8 9 10)))
</syntaxhighlight>
{{out}}
<pre>'(1 1 2 3 5 8 13 21 34 55)</pre>
=={{header|OxygenBasic}}==
An inner function keeps the name-space clean:
<
function fiboRatio() as double
function fibo( double i, j ) as double
Line 1,490 ⟶ 2,310:
print fiboRatio
</syntaxhighlight>
=={{header|PARI/GP}}==
This version uses a Y combinator to get a self-reference.
<
my(F=(k,f)->if(k<2,k,f(k-1,f)+f(k-2,f)));
if(n<0,(-1)^(n+1),1)*F(abs(n),F)
};</
{{works with|PARI/GP|2.8.1+}}
This version gets a self-reference from <code>self()</code>.
<
my(F=k->my(f=self());if(k<2,k,f(k-1)+f(k-2)));
if(n<0,(-1)^(n+1),1)*F(abs(n))
};</
=={{header|Pascal}}==
<syntaxhighlight lang="pascal">
program AnonymousRecursion;
function Fib(X: Integer): integer;
function DoFib(N: Integer): Integer;
begin
if N < 2 then DoFib:=N
else DoFib:=DoFib(N-1) + DoFib(N-2);
end;
begin
if X < 0 then Fib:=X
else Fib:=DoFib(X);
end;
var I,V: integer;
begin
for I:=-1 to 15 do
begin
V:=Fib(I);
Write(I:3,' - ',V:3);
if V<0 then Write(' - Error');
WriteLn;
end;
WriteLn('Hit Any Key');
ReadLn;
end.
</syntaxhighlight>
{{out}}
<pre>
-1 - -1 - Error
0 - 0
1 - 1
2 - 1
3 - 2
4 - 3
5 - 5
6 - 8
7 - 13
8 - 21
9 - 34
10 - 55
11 - 89
12 - 144
13 - 233
14 - 377
15 - 610
Hit Any Key
</pre>
=={{header|Perl}}==
{{trans|PicoLisp}}
<code>recur</code> isn't built into Perl, but it's easy to implement.
<
my $f = shift;
local *recurse = $f;
Line 1,522 ⟶ 2,397:
$m < 3 ? 1 : recurse($m - 1) + recurse($m - 2);
} $n;
}</
Although for this task, it would be fine to use a lexical variable (closure) to hold an anonymous sub reference, we can also just push it onto the args stack and use it from there:
<
my ($n) = @_;
die "negative arg $n" if $n < 0;
Line 1,536 ⟶ 2,411:
}
print(fib($_), " ") for (0 .. 10);</
One can also use <code>caller</code> to get the name of the current subroutine as a string, then call the sub with that string. But this won't work if the current subroutine is anonymous: <code>caller</code> will just return <code>'__ANON__'</code> for the name of the subroutine. Thus, the below program must check the sign of the argument every call, failing the task. Note that under stricture, the line <code>no strict 'refs';</code> is needed to permit using a string as a subroutine.
<
my $n = shift;
$n < 0 and die 'Negative argument';
no strict 'refs';
$n < 3 ? 1 : (caller(0))[3]->($n - 1) + (caller(0))[3]->($n - 2);
}</
===Perl 5.16 and __SUB__===
Perl 5.16 introduced __SUB__ which refers to the current subroutine.
<
say sub {
my $n = shift;
$n < 2 ? $n : __SUB__->($n-2) + __SUB__->($n-1)
}->($_) for 0..10</
=={{header|
{{libheader|Phix/Class}}
===using classes===
With proof that the private fib_i() does not pollute the outer namespace.
<!--<syntaxhighlight lang="phix">(notonline)-->
<span style="color: #008080;">without</span> <span style="color: #008080;">js</span> <span style="color: #000080;font-style:italic;">-- (no class yet)</span>
<span style="color: #008080;">class</span> <span style="color: #000000;">Fib</span>
<span style="color: #008080;">private</span> <span style="color: #008080;">function</span> <span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">return</span> <span style="color: #008080;">iff</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;"><</span><span style="color: #000000;">2</span><span style="color: #0000FF;">?</span><span style="color: #000000;">n</span><span style="color: #0000FF;">:</span><span style="color: #7060A8;">this</span><span style="color: #0000FF;">.</span><span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)+</span><span style="color: #7060A8;">this</span><span style="color: #0000FF;">.</span><span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">-</span><span style="color: #000000;">2</span><span style="color: #0000FF;">))</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #008080;">public</span> <span style="color: #008080;">function</span> <span style="color: #000000;">fib</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">if</span> <span style="color: #000000;">n</span><span style="color: #0000FF;"><</span><span style="color: #000000;">0</span> <span style="color: #008080;">then</span> <span style="color: #008080;">throw</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"constraint error"</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>
<span style="color: #008080;">return</span> <span style="color: #7060A8;">this</span><span style="color: #0000FF;">.</span><span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">class</span>
<span style="color: #000000;">Fib</span> <span style="color: #000000;">f</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">new</span><span style="color: #0000FF;">()</span>
<span style="color: #008080;">function</span> <span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">return</span> <span style="color: #7060A8;">sprintf</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"this is not the fib_i(%d) you are looking for\n"</span><span style="color: #0000FF;">,</span><span style="color: #000000;">i</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">f</span><span style="color: #0000FF;">.</span><span style="color: #000000;">fib</span><span style="color: #0000FF;">(</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<span style="color: #000080;font-style:italic;">--?f.fib_i(10) -- illegal</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">fib_i</span><span style="color: #0000FF;">(</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<!--</syntaxhighlight>-->
{{out}}
<pre>
55
"this is not the fib_i(10) you are looking for\n"
</pre>
===using a lambda expression===
Make of this what you will...<br>
Obviously the inner function does not have to and in fact is not allowed to have a name itself, but it needs to be stored in something with a name before it can be called,
and in being anonymous, in order to effect recursion it must be passed to itself, repeatedly and not really anonymous at all anymore.
<!--<syntaxhighlight lang="phix">(notonline)-->
<span style="color: #008080;">without</span> <span style="color: #008080;">js</span> <span style="color: #000080;font-style:italic;">-- (no lambda yet)</span>
<span style="color: #008080;">function</span> <span style="color: #000000;">erm</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">f</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">return</span> <span style="color: #000000;">f</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">f</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #008080;">function</span> <span style="color: #000000;">fib</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">if</span> <span style="color: #000000;">n</span><span style="color: #0000FF;"><</span><span style="color: #000000;">0</span> <span style="color: #008080;">then</span> <span style="color: #008080;">throw</span><span style="color: #0000FF;">(</span><span style="color: #008000;">"constraint error"</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">end</span> <span style="color: #008080;">if</span>
<span style="color: #008080;">return</span> <span style="color: #000000;">erm</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #008080;">function</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">n</span><span style="color: #0000FF;">,</span><span style="color: #000000;">f</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #008080;">iff</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;"><</span><span style="color: #000000;">2</span><span style="color: #0000FF;">?</span><span style="color: #000000;">n</span><span style="color: #0000FF;">:</span><span style="color: #000000;">f</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">f</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">f</span><span style="color: #0000FF;">(</span><span style="color: #000000;">n</span><span style="color: #0000FF;">-</span><span style="color: #000000;">2</span><span style="color: #0000FF;">,</span><span style="color: #000000;">f</span><span style="color: #0000FF;">))</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span><span style="color: #0000FF;">)</span>
<span style="color: #008080;">end</span> <span style="color: #008080;">function</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">fib</span><span style="color: #0000FF;">(</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>
<!--</syntaxhighlight>-->
{{out}}
<pre>
55
</pre>
=={{header|PHP}}==
In this solution, the function is always called using <code>call_user_func()</code> rather than using function call syntax directly. Inside the function, we get the function itself (without having to refer to the function by name) by relying on the fact that this function must have been passed as the first argument to <code>call_user_func()</code> one call up on the call stack. We can then use <code>debug_backtrace()</code> to get this out.
{{works with|PHP|5.3+}}
<
function fib($n) {
if ($n < 0)
Line 1,591 ⟶ 2,497:
}
echo fib(8), "\n";
?></
;With internal named recursive function:
{{works with|PHP|5.3+}}
<
function fib($n) {
if ($n < 0)
Line 1,608 ⟶ 2,514:
}
echo fib(8), "\n";
?></
;With a function object that can call itself using <code>$this</code>:
{{works with|PHP|5.3+}}
<
class fib_helper {
function __invoke($n) {
Line 1,629 ⟶ 2,535:
}
echo fib(8), "\n";
?></
=={{header|PicoLisp}}==
<
(if (lt0 N)
(quit "Illegal argument" N) )
Line 1,638 ⟶ 2,544:
(if (> 2 N)
1
(+ (recurse (dec N)) (recurse (- N 2))) ) ) )</
Explanation: The above uses the '[http://software-lab.de/doc/refR.html#recur recur]' / '[http://software-lab.de/doc/refR.html#recurse recurse]' function pair, which is defined as a standard language extensions as
<
(run (cdr recurse)) )</
Note how 'recur' dynamically defines the function 'recurse' at runtime, by binding the rest of the expression (i.e. the body of the 'recur' statement) to the symbol 'recurse'.
Line 1,647 ⟶ 2,553:
{{libheader|initlib}}
Postscript can make use of the higher order combinators to provide recursion.
<
/pfact {
{1} {*} primrec}.
Line 1,669 ⟶ 2,575:
% binary recursion
/fib {
{2 lt} {} {pred dup pred} {+} binrec}.</
=={{header|Prolog}}==
Works with SWI-Prolog and module <b>lambda</b>, written by <b>Ulrich Neumerkel</b> found there http://www.complang.tuwien.ac.at/ulrich/Prolog-inedit/lambda.pl
The code is inspired from this page : http://www.complang.tuwien.ac.at/ulrich/Prolog-inedit/ISO-Hiord#Hiord (p 106). It uses the Y combinator.
<
fib(N, _F) :-
Line 1,696 ⟶ 2,602:
Pred = PF +\Nb2^F2^call(PF,Nb2,F2,PF),
call(Pred,N,F).</
=={{header|Python}}==
<
>>> fib = lambda f: lambda n: None if n < 0 else (0 if n == 0 else (1 if n == 1 else f(n-1) + f(n-2)))
>>> [ Y(fib)(i) for i in range(-2, 10) ]
[None, None, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34]</
Same thing as the above, but modified so that the function is uncurried:
<
>>> Y = lambda f: (lambda x: x(x))(lambda y: partial(f, lambda *args: y(y)(*args)))
>>> fib = lambda f, n: None if n < 0 else (0 if n == 0 else (1 if n == 1 else f(n-1) + f(n-2)))
>>> [ Y(fib)(i) for i in range(-2, 10) ]
[None, None, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34]</
A different approach: the function always receives itself as the first argument, and when recursing, makes sure to pass the called function as the first argument also
<
>>> Y = lambda f: partial(f, f)
>>> fib = lambda f, n: None if n < 0 else (0 if n == 0 else (1 if n == 1 else f(f, n-1) + f(f, n-2)))
>>> [ Y(fib)(i) for i in range(-2, 10) ]
[None, None, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34]</
An interesting approach using introspection (from http://metapython.blogspot.com/2010/11/recursive-lambda-functions.html)
<
>>> from inspect import currentframe
>>> from types import FunctionType
Line 1,729 ⟶ 2,635:
>>> print "factorial(5) =",
>>> print (lambda n:1 if n<=1 else n*myself(n-1)) ( 5 )
</syntaxhighlight>
Another way of implementing the "Y" function is given in this post: https://stackoverflow.com/questions/481692/can-a-lambda-function-call-itself-recursively-in-python. The main problem to solve is that the function "fib" can't call itself. Therefore, the function "Y" is used to help "fib" call itself.
<syntaxhighlight lang="python">
>>> Y = lambda f: lambda n: f(f,n)
>>> fib = lambda f, n: None if n < 0 else (0 if n == 0 else (1 if n == 1 else f(f,n-1) + f(f,n-2))) #same as the first three implementations
>>> [ Y(fib)(i) for i in range(-2, 10) ]
[None, None, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
</syntaxhighlight>
All in one line:
<syntaxhighlight lang="python">
>>> fib_func = (lambda f: lambda n: f(f,n))(lambda f, n: None if n < 0 else (0 if n == 0 else (1 if n == 1 else f(f,n-1) + f(f,n-2))))
>>> [ fib_func(i) for i in range(-2, 10) ]
[None, None, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
</syntaxhighlight>
=={{header|QBasic}}==
{{works with|QBasic}}
{{trans|BASIC256}}
<syntaxhighlight lang="qbasic">DECLARE FUNCTION Fibonacci! (num!)
PRINT Fibonacci(20)
PRINT Fibonacci(30)
PRINT Fibonacci(-10)
PRINT Fibonacci(10)
END
FUNCTION Fibonacci (num)
IF num < 0 THEN
PRINT "Invalid argument: ";
Fibonacci = num
END IF
IF num < 2 THEN
Fibonacci = num
ELSE
Fibonacci = Fibonacci(num - 1) + Fibonacci(num - 2)
END IF
END FUNCTION</syntaxhighlight>
{{out}}
<pre>
Igual que la entrada de BASIC256.
</pre>
=={{header|Qi}}==
Line 1,738 ⟶ 2,690:
However, it can be done, for instance like this:
<syntaxhighlight lang="qi">
(define fib
N -> (let A (/. A N
Line 1,746 ⟶ 2,698:
(A A (- N 1)))))
(A A N)))
</syntaxhighlight>
=={{header|Quackery}}==
Quackery can do anonymous recursion via the word <code>recurse</code>.
<pre>[ dup 0 < iff
$ "negative argument passed to fibonacci"
fail
[ dup 2 < if done
dup 1 - recurse
swap 2 - recurse + ] ] is fibonacci ( n --> n )</pre>
<code>recurse</code> causes the current nest (i.e. the on that starts <code>[ dup</code> and ends <code>+ ]</code> to be evaluated recursively. This means that if, for example, the first recursive call was inside one or more nested nests, it would not work as desired. So the first instance of <code>recurse</code> in:
<pre>( *** faulty code *** )
[ dup 0 < iff
$ "negative argument passed to fibonacci"
fail
[ dup 2 < if done
[ [ [ [ [ [
[ dup 1 - recurse ]
] ] ] ] ] ]
swap 2 - recurse + ] ] is fibonacci ( n --> n )</pre>
would cause the nest <code>[ dup 1 - recurse ]</code>to be evaluated, and the program would go into a tailspin, recursively evaluating that nest until the return stack overflowed.
This limitation can be overcome with the understanding that recursion can be factored out into two ideas, i.e. self-reference and evaluation. The self-reference word in Quackery is <code>this</code>, which puts a pointer to the current nest on the data stack (usually just called "the stack") and the evaluation word is <code>do</code>, which takes an item from the stack and evaluates it. So <code>this do</code> is equivalent to <code>recurse</code>.
The final example fixes the previous example by using <code>this</code> and <code>do</code> to put the pointer to the current nest on the stack at the correct level of nesting and evaluate it within the nested nests. See also [http://rosettacode.org/wiki/Even_or_odd#Quackery:_With_Anonymous_Mutual_Recursion Even or Odd#Quackery: With Anonymous Mutual recursion].
<pre>[ dup 0 < iff
$ "negative argument passed to fibonacci"
fail
[ dup 2 < if done
this
[ [ [ [ [ [
[ dip [ dup 1 - ] do ]
] ] ] ] ] ]
swap 2 - recurse + ] ] is fibonacci ( n --> n )
</pre>
Quackery also provides named recursion with <code>forward</code> and <code>resolves</code>, so this is usually not ''necessary'' but can be useful in unusual circumstances.
=={{header|R}}==
R provides Recall() as a wrapper which finds the calling function, with limitations; Recall will not work if passed to another function as an argument.
<
(n >= 0) || stop("bad argument")
( function(n) if (n <= 1) 1 else Recall(n-1)+Recall(n-2) )(n)
}</
=={{header|Racket}}==
Line 1,759 ⟶ 2,753:
In Racket, local helper function definitions inside of a function are only visible locally and do not pollute the module or global scope.
<
#lang racket
Line 1,778 ⟶ 2,772:
(check-equal? (fact 0) 1)
(check-equal? (fact 5) 120))
</syntaxhighlight>
This calculates the slightly more complex Fibonacci funciton:
<
#lang racket
;; Natural -> Natural
Line 1,802 ⟶ 2,796:
'(0 1 1 2 3 5 8 13 21 34 55 89 144 233
377 610 987 1597 2584 4181 6765)))
</syntaxhighlight>
Also with the help of first-class functions in Racket, anonymous recursion can be implemented using fixed-points operators:
<
#lang racket
;; We use Z combinator (applicative order fixed-point operator)
Line 1,821 ⟶ 2,815:
(+ (fibo (- n 1))
(fibo (- n 2))))))))
</syntaxhighlight>
<pre>
Line 1,831 ⟶ 2,825:
55
</pre>
=={{header|Raku}}==
(formerly Perl 6)
{{works with|Rakudo|2015.12}}
In addition to the methods in the [[Perl]] entry above, and the Y-combinator described in [[Y_combinator]], you may also refer to an anonymous block or function from the inside:
<syntaxhighlight lang="raku" line>sub fib($n) {
die "Naughty fib" if $n < 0;
return {
$_ < 2
?? $_
!! &?BLOCK($_-1) + &?BLOCK($_-2);
}($n);
}
say fib(10);</syntaxhighlight>
However, using any of these methods is insane, when Raku provides a sort of inside-out combinator that lets you define lazy infinite constants, where the demand for a particular value is divorced from dependencies on more primitive values. This operator, known as the sequence operator, does in a sense provide anonymous recursion to a closure that refers to more primitive values.
<syntaxhighlight lang="raku" line>constant @fib = 0, 1, *+* ... *;
say @fib[10];</syntaxhighlight>
Here the closure, <tt>*+*</tt>, is just a quick way to write a lambda, <tt>-> $a, $b { $a + $b }</tt>. The sequence operator implicitly maps the two arguments to the -2nd and -1st elements of the sequence. So the sequence operator certainly applies an anonymous lambda, but whether it's recursion or not depends on whether you view a sequence as iteration or as simply a convenient way of memoizing a recursion. Either view is justifiable.
At this point someone may complain that the solution is doesn't fit the specified task because the sequence operator doesn't do the check for negative. True, but the sequence operator is not the whole of the solution; this check is supplied by the subscripting operator itself when you ask for <tt>@fib[-1]</tt>. Instead of scattering all kinds of arbitrary boundary conditions throughout your functions, the sequence operator maps them quite naturally to the boundary of definedness at the start of a list.
=={{header|REBOL}}==
<
fib: func [n /f][ do f: func [m] [ either m < 2 [m][(f m - 1) + f m - 2]] n]
</syntaxhighlight>
=={{header|REXX}}==
Line 1,843 ⟶ 2,859:
to be OK with the implementers, here are the REXX versions.
===simplistic===
<
numeric digits 1e6 /*in case the user goes ka-razy with X.*/
parse arg x . /*obtain the optional argument from CL.*/
if x=='' | x=="," then x=
w= length(x)
do j=0 for x+1 /*use the argument as an upper limit.*/
say 'fibonacci('right(j, w)") =" fib(j)
end /*j*/ /* [↑] show Fibonacci sequence: 0 ──► X*/
exit
/*──────────────────────────────────────────────────────────────────────────────────────*/
fib: procedure; parse arg z; if z>=0 then return .(z)
say "***error*** argument can't be negative."; exit
.: procedure; parse arg #; if #<2 then return #; return .(#-1) + .(#-2)</
<pre>
fibonacci( 0) = 0
Line 1,874 ⟶ 2,890:
===memoization===
Since the above REXX version is ''very'' slow for larger numbers, the following version was added that incorporates memoization.
<br>It's many orders of magnitude faster for larger values.
<syntaxhighlight lang="rexx">/*REXX program to show anonymous recursion of a function or subroutine with memoization.*/
numeric digits 1e6 /*in case the user goes ka-razy with X.*/
parse arg x . /*obtain the optional argument from CL.*/
if x=='' | x=="," then x=
@.= .; @.0= 0; @.1=
w= length(x)
do j=0 for x+1 /*use the argument as an upper limit.*/
say 'fibonacci('right(j, w)") =" fib(j)
end /*j*/ /* [↑] show Fibonacci sequence: 0 ──► X*/
exit
/*──────────────────────────────────────────────────────────────────────────────────────*/
fib: procedure expose @.; arg z; if z>=0 then return .(z)
say "***error*** argument can't be negative."; exit
.: procedure expose @.; arg #; if @.#\==. then return @.#; @.#=.(#-1)+.(#-2); return @.#</
=={{header|Ring}}==
<syntaxhighlight lang="ring">
# Project : Anonymous recursion
t=0
for x = -2 to 12
n = x
recursion()
if x > -1
see t + nl
ok
next
func recursion()
nold1=1
nold2=0
if n < 0
see "positive argument required!" + nl
return
ok
if n=0
t=nold2
return t
ok
if n=1
t=nold1
return t
ok
while n
t=nold2+nold1
if n>2
n=n-1
nold2=nold1
nold1=t
loop
ok
return t
end
return t
</syntaxhighlight>
Output:
<pre>
positive argument required!
positive argument required!
0
1
1
2
3
5
8
13
21
34
55
89
144
</pre>
=={{header|RPL}}==
===Hidden variable===
The recursive part of the function is stored in a local variable, which is made accessible to all the recursive instances by starting its name with the <code>←</code> character.
{{works with|HP|48G}}
≪ ≪ '''IF''' DUP 1 > '''THEN'''
DUP 1 - ←fib EVAL
SWAP 2 - ←fib EVAL +
'''END''' ≫ → ←fib
≪ '''IF''' DUP 0 <
'''THEN''' DROP "Negative value" DOERR
'''ELSE''' ←fib EVAL '''END'''
≫ ≫ '<span style="color:blue">FIBAR</span>' STO
-2 <span style="color:blue">FIBAR</span>
10 <span style="color:blue">FIBAR</span>
{{out}}
<pre>
1: 55
</pre>
===Truly anonymous===
Both the recursive block and the argument are pushed onto the stack, without any naming. This meets the requirements of the task perfectly and works on any RPL machine, but it is far from idiomatic and uses a lot of stack space.
{{works with|HP|28}}
≪ '''IF''' DUP 0 <
'''THEN''' DROP "Negative value"
'''ELSE'''
≪ '''IF''' DUP 1 > '''THEN'''
DUP2 1 - OVER EVAL
ROT ROT 2 - OVER EVAL +
'''ELSE''' SWAP DROP '''END'''
≫
SWAP OVER EVAL
'''END'''
≫ '<span style="color:blue">FIBAR</span>' STO
=={{header|Ruby}}==
Line 1,896 ⟶ 3,006:
We can recurse a block of code, but we must provide the block with a reference to itself. The easiest solution is to use a local variable.
===Ruby with local variable===
<
raise RangeError, "fib of negative" if n < 0
(fib2 = proc { |m| m < 2 ? m : fib2[m - 1] + fib2[m - 2] })[n]
end</
<
=> [:error, :error, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]</
Here 'fib2' is a local variable of the fib() method. Only the fib() method, or a block inside the fib() method, can call this 'fib2'. The rest of this program cannot call this 'fib2', but it can use the name 'fib2' for other things.
Line 1,910 ⟶ 3,020:
'''Caution!''' The recursive block has a difference from Ruby 1.8 to Ruby 1.9. Here is the same method, except changing the block parameter from 'm' to 'n', so that block 'n' and method 'n' have the same name.
<
raise RangeError, "fib of negative" if n < 0
(fib2 = proc { |n| n < 2 ? n : fib2[n - 1] + fib2[n - 2] })[n]
end</
<
(-2..12).map { |i| fib i rescue :error }
=> [:error, :error, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]
Line 1,920 ⟶ 3,030:
# Ruby 1.8
(-2..12).map { |i| fib i rescue :error }
=> [:error, :error, 0, 1, 0, -3, -8, -15, -24, -35, -48, -63, -80, -99, -120]</
Ruby 1.9 still shows the correct answer, but Ruby 1.8 shows the wrong answer. With Ruby 1.9, 'n' is still a local variable of the block. With Ruby 1.8, 'n' of the block closes on 'n' of the fib() method. All calls to the block share the 'n' of one call to the method. So <tt>fib2[n - 1]</tt> changes the value of 'n', and <tt>fib2[n - 2]</tt> uses the wrong value of 'n', thus the wrong answer.
===Ruby with Hash===
<
raise RangeError, "fib of negative" if n < 0
Hash.new { |fib2, m|
fib2[m] = (m < 2 ? m : fib2[m - 1] + fib2[m - 2]) }[n]
end</
This uses a Hash to memoize the recursion. After <tt>fib2[m - 1]</tt> returns, <tt>fib2[m - 2]</tt> uses the value in the Hash, without redoing the calculations.
Line 1,935 ⟶ 3,045:
{{trans|PicoLisp}}
{{libheader|continuation}}
<
module Kernel
Line 1,954 ⟶ 3,064:
raise RangeError, "fib of negative" if n < 0
recur(n) { |m| m < 2 ? m : (recurse m - 1) + (recurse m - 2) }
end</
Our recursive block now lives in the 'block' variable of the Kernel#recur method.
Line 1,963 ⟶ 3,073:
{{trans|JavaScript}}
{{libheader|continuation}}
<
module Kernel
Line 1,994 ⟶ 3,104:
end
}[n]
end</
Our recursive block now lives in the 'block' variable of the Kernel#function method. Another block 'f' wraps our original block and sets up the 'arguments' array. Kernel#function returns this wrapper block. Kernel#arguments plays a trick to get the array of arguments from 'f'; this array has an extra singleton method #callee which returns 'f'.
=={{header|Rust}}==
<syntaxhighlight lang="rust">fn fib(n: i64) -> Option<i64> {
// A function declared inside another function does not pollute the outer namespace.
fn actual_fib(n: i64) -> i64 {
if n < 2 {
n
} else {
actual_fib(n - 1) + actual_fib(n - 2)
}
}
if n < 0 {
None
} else {
Some(actual_fib(n))
}
}
fn main() {
println!("Fib(-1) = {:?}", fib(-1));
println!("Fib(0) = {:?}", fib(0));
println!("Fib(1) = {:?}", fib(1));
println!("Fib(2) = {:?}", fib(2));
println!("Fib(3) = {:?}", fib(3));
println!("Fib(4) = {:?}", fib(4));
println!("Fib(5) = {:?}", fib(5));
println!("Fib(10) = {:?}", fib(10));
}
#[test]
fn test_fib() {
assert_eq!(fib(0).unwrap(), 0);
assert_eq!(fib(1).unwrap(), 1);
assert_eq!(fib(2).unwrap(), 1);
assert_eq!(fib(3).unwrap(), 2);
assert_eq!(fib(4).unwrap(), 3);
assert_eq!(fib(5).unwrap(), 5);
assert_eq!(fib(10).unwrap(), 55);
}
#[test]
fn test_invalid_argument() {
assert_eq!(fib(-1), None);
}</syntaxhighlight>
=={{header|Scala}}==
Using a Y-combinator:
<
def fib(n: Int): Option[Int] =
Line 2,007 ⟶ 3,162:
else f(i - 1) + f(i - 2))(n))
-2 to 5 map (n ⇒ (n, fib(n))) foreach println</
{{out}}
<pre>
Line 2,022 ⟶ 3,177:
=={{header|Scheme}}==
This uses named let to create a function (aux) that only exists inside of fibonacci:
<
(if (> 0 n)
"Error: argument must not be negative."
Line 2,030 ⟶ 3,185:
(aux (+ a b) a (- count 1))))))
(map fibonacci '(1 2 3 4 5 6 7 8 9 10))</
{{out}}
<pre>'(1 1 2 3 5 8 13 21 34 55)</pre>
Line 2,036 ⟶ 3,191:
=={{header|Seed7}}==
Uses a local function to do the dirty work. The local function has a name, but it is not in the global namespace.
<
const func integer: fib (in integer: x) is func
Line 2,067 ⟶ 3,222:
writeln(fib(i));
end for;
end func;</
{{out}}
Line 2,080 ⟶ 3,235:
=={{header|Sidef}}==
__FUNC__ refers to the current function.
<syntaxhighlight lang="ruby">func fib(n) {
return NaN if (n < 0)
func (n) {
n < 2 ? n
: (__FUNC__(n-
}(
}</syntaxhighlight>
__BLOCK__ refers to the current block.
<syntaxhighlight lang="ruby">func fib(n) {
{|n|
n < 2 ? n
: (__BLOCK__(n-
}(
}</syntaxhighlight>
=={{header|Smalltalk}}==
In Smalltalk, things are referred to by a name, so the following may not fully qualify as solutions.
<br>Also: doing things like this is not considered "good style" (''give things a good name to make the meaning obvious'').
Notice, that none of the two solutions below ''pollutes any namespace'';
in (a), the variable introduced is strictly local to the method, in (b) not even a method-local is introduced (so maybe (b) does qualify, after all).
a) Use a funny local name (in this case: "_").
Here the closure is defined as "_", and then evaluated (by sending it a <tt>value:</tt> message).
<syntaxhighlight lang="smalltalk">
myMethodComputingFib:arg
|_|
^ (_ := [:n | n <= 1
ifTrue:[n]
ifFalse:[(_ value:(n - 1))+(_ value:(n - 2))]]
) value:arg.</syntaxhighlight>
b) Define it in a local scope to not infect the outer scopes.
<br>Here, a separate closure is defined (and evaluated with <tt>value</tt>), in which fib is defined and evaluated with the argument.
This is semantically equivalent to the named let solution of Scheme.
<syntaxhighlight lang="smalltalk">
myMethodComputingFib2:arg
^ [
|fib|
[:n | n <= 1
ifTrue:[1]
ifFalse:[(fib value:(n - 1))+(fun value:(n - 2))]] value:arg.
] value.</syntaxhighlight>
To completely make it anonymous, we could use reflection to get at the current executed block (via thisContext),
but that is too ugly and obfuscating to be shown here.
=={{header|Sparkling}}==
As a function expression:
<
return f(n, f);
}(10, function(n, f) {
return n < 2 ? 1 : f(n - 1, f) + f(n - 2, f);
})
</syntaxhighlight>
When typed into the REPL:
<
= 89</
=={{header|Standard ML}}==
ML does not have a built-in construct for anonymous recursion, but you can easily write your own fix-point combinator:
<
fun fib n =
Line 2,121 ⟶ 3,310:
(fn 0 => 0
| 1 => 1
| n => fib (n-1) + fib (n-2))) n</
Instead of using a fix-point, the more common approach is to locally define a recursive function and call it once:
<
let
fun fib 0 = 0
Line 2,134 ⟶ 3,323:
else
fib n
end</
In this example the local function has the same name as the outer function. This is fine: the local definition shadows
Line 2,140 ⟶ 3,329:
Another variation is possible. Instead, we could define the recursive "fib" at top-level, then shadow it with a non-recursive wrapper. To force the wrapper to be non-recursive, we use the "val" syntax instead of "fun":
<
| fib 1 = 1
| fib n = fib (n-1) + fib (n-2)
val fib = fn n => if n < 0 then raise Fail "Negative"
else fib n</
=={{header|SuperCollider}}==
SuperCollider has a keyword "thisFunction", which refers to the current function context. The example below uses this for anonymous recursion. One may think that "thisFunction" would refer to the second branch of the if statement, but because if statements are inlined, the function is the outer one.
<syntaxhighlight lang="supercollider">
(
f = { |n|
if(n >= 0) {
if(n < 2) { n } { thisFunction.(n-1) + thisFunction.(n-2) }
}
};
(0..20).collect(f)
)
</syntaxhighlight>
=={{header|Swift}}==
;With internal named recursive closure:
{{works with|Swift|2.x}}
<
func f(n: Int) -> Int {
assert(n >= 0, "fib: no negative numbers")
Line 2,158 ⟶ 3,362:
}()
print(fib(8))</
{{works with|Swift|1.x}}
<
var f: (Int -> Int)!
f = { n in
Line 2,169 ⟶ 3,373:
}()
println(fib(8))</
;Using Y combinator:
<
let o : RecursiveFunc<F> -> F
}
Line 2,186 ⟶ 3,390:
}
println(fib(8))</
=={{header|Tailspin}}==
See the actual fibonacci solution [[Fibonacci_sequence#State_machine]]
=={{header|Tcl}}==
This solution uses Tcl 8.5's lambda terms, extracting the current term from the call stack using introspection (storing it in a local variable only for convenience, with that ''not'' in any way being the name of the lambda term; just what it is stored in, and only as a convenience that keeps the code shorter). The lambda terms are applied with the <code>apply</code> command.
<
# sanity checks
if {[incr n 0] < 0} {error "argument may not be negative"}
Line 2,199 ⟶ 3,406:
expr {[apply $f [incr x -1]] + [apply $f [incr x -1]]}
}} $n
}</
Demonstrating:
<syntaxhighlight lang
{{out}}}
<pre>144</pre>
The code above can be written without even using a local variable to hold the lambda term, though this is generally less idiomatic because the code ends up longer and clumsier:
<
if {[incr n 0] < 0} {error "argument may not be negative"}
apply {x {expr {
Line 2,213 ⟶ 3,420:
+ [apply [lindex [info level 0] 1] [incr x -1]]
}}} $n
}</
However, we can create a <code>recurse</code> function that makes this much more straight-forward:
<
proc tcl::mathfunc::recurse args {apply [lindex [info level -1] 1] {*}$args}
proc fib n {
Line 2,222 ⟶ 3,429:
$x < 2 ? $x : recurse([incr x -1]) + recurse([incr x -1])
}}} $n
}</
=={{header|True BASIC}}==
{{trans|BASIC256}}
{{works with|QBasic}}
<syntaxhighlight lang="qbasic">FUNCTION Fibonacci (num)
IF num < 0 THEN
PRINT "Invalid argument: ";
LET Fibonacci = num
END IF
IF num < 2 THEN
LET Fibonacci = num
ELSE
LET Fibonacci = Fibonacci(num - 1) + Fibonacci(num - 2)
END IF
END FUNCTION
PRINT Fibonacci(20)
PRINT Fibonacci(30)
PRINT Fibonacci(-10)
PRINT Fibonacci(10)
END</syntaxhighlight>
{{out}}
<pre>
Igual que la entrada de BASIC256.
</pre>
=={{header|TXR}}==
For the Y combinator approach in TXR, see the Y combinator task.
Line 2,232 ⟶ 3,466:
{{trans|Common_Lisp}}
<
(let ((hidden-name (gensym "RECURSIVE-")))
^(macrolet ((recurse (. args) ^(,',hidden-name ,*args)))
Line 2,247 ⟶ 3,481:
(put-line `fib(10) = @(fib 10)`)
(put-line `fib(-1) = @(fib -1)`))</
{{out}}
Line 2,260 ⟶ 3,494:
=={{header|UNIX Shell}}==
The shell does not have anonymous functions. Every function must have a name. However, one can create a subshell such that some function, which has a name in the subshell, is effectively anonymous to the parent shell.
<
if test 0 -gt "$1"; then
echo "fib: fib of negative" 1>&2
Line 2,276 ⟶ 3,510:
)
fi
}</
<
> fib $i
> done
Line 2,294 ⟶ 3,528:
55
89
144</
=={{header|Ursala}}==
<
fib =
Line 2,309 ⟶ 3,543:
predecessor^~( # with the respective predecessors of
~&, # the given argument
predecessor)))) # and the predecessor thereof</
Anonymous recursion is often achieved using the recursive conditional operator, <code>( _ )^?( _ , _ )</code>, which takes a predicate on the left and a pair of functions on the right, typically one for the base and one for the inductive case in a recursive definition. The form <code>^?<</code> can be used if the relevant predicate is given by membership of the argument in a constant set, in which case only the set needs to be specified rather than the whole predicate.
The recursive conditional operator <code>^?</code> differs from the ordinary conditional <code>?</code> seen at the outermost level by arranging for its predicate and component functions to be given an input of the form <math>(f,a)</math> where <math>a</math> is the original argument, and <math>f</math> is a copy of the whole function. Code within the function body may then access itself anonymously according to all the usual language idioms pertaining to deconstruction of tuples, and call itself by any of several recursion combinators, such as the pairwise recursion form <code>W</code> seen above.
=={{header|UTFool}}==
'''Solution with anonymous class'''
<syntaxhighlight lang="utfool">
···
http://rosettacode.org/wiki/Anonymous_recursion
···
⟦import java.util.function.UnaryOperator;⟧
■ AnonymousRecursion
§ static
▶ main
• args⦂ String[]
if 0 > Integer.valueOf args[0]
System.out.println "negative argument"
else
System.out.println *UnaryOperator⟨Integer⟩° ■
▶ apply⦂ Integer
• n⦂ Integer
⏎ n ≤ 1 ? n ! (apply n - 1) + (apply n - 2)
°.apply Integer.valueOf args[0]
</syntaxhighlight>
=={{header|VBA}}==
<syntaxhighlight lang="vb">
Sub Main()
Debug.Print F(-10)
Debug.Print F(10)
End Sub
Private Function F(N As Long) As Variant
If N < 0 Then
F = "Error. Negative argument"
ElseIf N <= 1 Then
F = N
Else
F = F(N - 1) + F(N - 2)
End If
End Function</syntaxhighlight>
{{out}}
<pre>Error. Negative argument
55</pre>
=={{header|Wart}}==
<
if (n >= 0)
(transform n :thru (afn (n)
Line 2,321 ⟶ 3,599:
n
(+ (self n-1)
(self n-2)))))</
<code>afn</code> creates an anonymous function that can be recursed by calling <code>self</code>.
=={{header|WDTE}}==
<syntaxhighlight lang="wdte">let str => 'strings';
let fib n => switch n {
< 0 => str.format 'Bad argument: {q}' n;
default => n -> (@ memo s n => switch n {
== 0 => 0; == 1 => 1;
default => + (s (- n 1)) (s (- n 2));
});
};</syntaxhighlight>
In WDTE, a lambda, defined in a block delineated by <code>(@)</code>, gets passed itself as its first argument, allowing for recursion.
=={{header|Wren}}==
<
static compute(n) {
var fib
Line 2,339 ⟶ 3,629:
}
}
System.print(Fibonacci.compute(36))</syntaxhighlight>
{{out}}
<pre>
14930352
</pre>
=={{header|x86 Assembly}}==
{{works with|NASM}}
{{works with|Linux}}
32 bit
Fakes the actual first call to the function that generates Fibonacci numbers.
The address of the instructions after the function get put on the stack and then execution continues into the actual function.
When the recursion is complete, instead of returning to the location of the call it goes to the end of the loop.
<syntaxhighlight lang="asm">
; Calculates and prints Fibonacci numbers (Fn)
; Prints numbers 1 - 47 (largest 32bit Fn that fits)
; Build:
; nasm -felf32 fib.asm
; ld -m elf32_i386 fib.o -o fib
global _start
section .text
_start:
mov ecx, 48 ; Initialize loop counter
.loop:
mov ebx, 48 ; Calculate which Fn will be computed
sub ebx, ecx ; Takes into account the reversed nature
push ebx ; Pass the parameter in on the stack
push .done ; Emulate a call but "return" to end of loop
; The return adress is manually set on the stack
; int fib (int n)
; Returns the n'th Fn
; fib(n) = 0 if n <= 0
; 1 if n == 1
; fib(n-1) + fib(n-2) otherwise
.fib:
push ebp ; Setup stack frame
mov ebp, esp
push ebx ; Save needed registers
xor eax, eax
mov ebx, [ebp + 8] ; Get the parameter
cmp ebx, 1 ; Test for base cases
jl .return
mov eax, 1
je .return
dec ebx ; Calculate fib(n-1)
push ebx
call .fib
mov [esp], eax ; Save result on top of parameter in stack
dec ebx ; Calculate fib(n-2)
push ebx
call .fib
add eax, [esp + 4] ; Add the first to the second
add esp, 8 ; Reset local stack
.return:
pop ebx ; Restore modified registers
mov esp, ebp ; Tear down stack frame and return
pop ebp
ret
.done:
mov [esp], ecx ; Save the counter between calls
push eax ; Print the number
call print_num
add esp, 4
pop ecx ; Restore the loop counter
loop .loop ; Loop until 0
mov eax, 0x01 ; sys_exit(int error)
xor ebx, ebx ; error = 0 (success)
int 0x80 ; syscall
; void print_num (int n)
; Prints an integer and newline
print_num:
push ebp
mov ebp, esp
sub esp, 11 ; Save space for digits and newline
lea ecx, [ebp - 1] ; Save a pointer to after the buffer
mov BYTE [ecx], 0x0A ; Set the newline at the end
mov eax, [ebp + 8] ; Get the parameter
mov ebx, DWORD 10 ; Divisor
.loop:
dec ecx ; Move pointer to next digit
xor edx, edx
div ebx ; Extract one digit, quot in eax, rem in edx
add dl, 0x30 ; Convert remainder to ascii
mov [ecx], dl ; Save the ascii form
cmp eax, 0 ; Loop until all digits have been converted
jg .loop
mov eax, 0x04 ; sys_write(int fd, char **buf, int len)
mov ebx, 1 ; stdout
mov edx, ebp ; Calculate the length
sub edx, ecx ; address after newline - address of first digit
int 0x80
mov esp, ebp
pop ebp
ret
</syntaxhighlight>
=={{header|XPL0}}==
Line 2,346 ⟶ 3,741:
This makes those nested functions invisible to the outside, thus preventing namespace pollution.
<
func Fib(X);
Line 2,362 ⟶ 3,757:
[IntOut(0, Fib(8)); CrLf(0);
IntOut(0, Fib(-2)); CrLf(0);
]</
{{out}}
Line 2,369 ⟶ 3,764:
Error 0
</pre>
=={{header|Yabasic}}==
{{trans|AutoIt}}
<syntaxhighlight lang="yabasic">print Fibonacci(-10)
print Fibonacci(10)
sub Fibonacci(number)
If number < 0 print "Invalid argument: "; : return number
If number < 2 Then
Return number
Else
Return Fibonacci(number - 1) + Fibonacci(number - 2)
EndIf
end sub</syntaxhighlight>
=={{header|zkl}}==
<
if (n<0) throw(Exception.ValueError);
fcn(n){
Line 2,380 ⟶ 3,793:
fib(8) .println();
fib(-8).println();
</syntaxhighlight>
{{out}}
<pre>
Line 2,389 ⟶ 3,802:
=={{header|ZX Spectrum Basic}}==
{{trans|AutoHotkey}}
<
20 LET t=0
30 GO SUB 60
Line 2,401 ⟶ 3,814:
110 IF n>2 THEN LET n=n-1: LET nold2=nold1: LET nold1=t: GO SUB 100
120 RETURN
</syntaxhighlight>
{{omit from|ACL2}}
{{omit from|Euphoria}}
{{omit from|PureBasic}}
{{omit from|Stata}}
| |||