aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Another update from ingydotnet^djgoku

Browse source
This commit is contained in:
Ingy döt Net 2015-11-18 06:14:39 +00:00
parent 91df62d461
commit 948b86eafa
7604 changed files with 108452 additions and 22726 deletions
Download patch file Download diff file Expand all files Collapse all files

46
Task/Y-combinator/REXX/y-combinator.rexx
View file

@ -1,24 +1,22 @@
/*REXX program to implement a stateless Y combinator. */
numeric digits 1000 /*allow big 'uns. */
say ' fib' Y(fib (50)) /*Fibonacci series*/
say ' fib' Y(fib (12 11 10 9 8 7 6 5 4 3 2 1 0)) /*Fibonacci series*/
say ' fact' Y(fact (60)) /*single fact. */
say ' fact' Y(fact (0 1 2 3 4 5 6 7 8 9 10 11)) /*single fact. */
say ' Dfact' Y(dfact (4 5 6 7 8 9 10 11 12 13)) /*double fact. */
say ' Tfact' Y(tfact (4 5 6 7 8 9 10 11 12 13)) /*triple fact. */
say ' Qfact' Y(qfact (4 5 6 7 8 40)) /*quadruple fact. */
say ' length' Y(length (when for to where whenceforth)) /*lengths of words*/
say 'reverse' Y(reverse (23 678 1007 45 MAS I MA)) /*reverses strings*/
say ' trunc' Y(trunc (-7.0005 12 3.14159 6.4 78.999)) /*truncates numbs.*/
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────subroutines─────────────────────────*/
Y: lambda=; parse arg Y _; do j=1 for words(_); interpret ,
'lambda=lambda' Y'('word(_,j)')'; end; return lambda
fib: procedure; parse arg x; if x<2 then return x; s=0; a=0; b=1
do j=2 to x; s=a+b; a=b; b=s; end; return s
dfact: procedure; arg x; !=1; do j=x to 2 by -2;!=!*j; end; return !
tfact: procedure; arg x; !=1; do j=x to 2 by -3;!=!*j; end; return !
qfact: procedure; arg x; !=1; do j=x to 2 by -4;!=!*j; end; return !
fact: procedure; arg x; !=1; do j=2 to x ;!=!*j; end; return !
/*REXX program implements and displays a stateless Y combinator. */
numeric digits 1000 /*allow big numbers. */
say ' fib' Y(fib (50)) /*Fibonacci series. */
say ' fib' Y(fib (12 11 10 9 8 7 6 5 4 3 2 1 0)) /*Fibonacci series. */
say ' fact' Y(fact (60)) /*single factorial*/
say ' fact' Y(fact (0 1 2 3 4 5 6 7 8 9 10 11)) /*single factorial*/
say ' Dfact' Y(dfact (4 5 6 7 8 9 10 11 12 13)) /*double factorial*/
say ' Tfact' Y(tfact (4 5 6 7 8 9 10 11 12 13)) /*triple factorial*/
say ' Qfact' Y(qfact (4 5 6 7 8 40)) /*quadruple factorial*/
say ' length' Y(length (when for to where whenceforth)) /*lengths of words.*/
say 'reverse' Y(reverse (23 678 1007 45 MAS I MA)) /*reverses strings. */
say ' trunc' Y(trunc (-7.0005 12 3.14159 6.4 78.999)) /*truncates numbers. */
exit /*stick a fork in it, we're all done. */
/*────────────────────────────────────────────────────────────────────────────*/
Y: parse arg Y _; $= /*the Y combinator.*/
do j=1 for words(_); interpret '$=$' Y"("word(_,j)')'; end; return $
fib: procedure; parse arg x; if x<2 then return x; s=0; a=0; b=1
s=0; a=0; b=1; do j=2 to x; s=a+b; a=b; b=s; end; return s
dfact: procedure; parse arg x; !=1; do j=x to 2 by -2; !=!*j; end; return !
tfact: procedure; parse arg x; !=1; do j=x to 2 by -3; !=!*j; end; return !
qfact: procedure; parse arg x; !=1; do j=x to 2 by -4; !=!*j; end; return !
fact: procedure; parse arg x; !=1; do j=2 to x ; !=!*j; end; return !