Tacit programming: Difference between revisions

Content deleted Content added
m Python: "is written" -> "can be written" so readers don't think the first example is in point-free style
Matju2 (talk | contribs)
Line 172:
evaluates to 4 since pow(x;y) is x to the power y.
 
=====FibonnaciFibonacci sequence=====
 
A tacit jq program for generating the FibonnaciFibonacci sequence would be:
 
[0,1] | recurse( [last, add] ) | first
 
Here, [0,1] is the initial pair to be taken as the first two items
in the FibonnaciFibonacci sequence. (The pair [1,1] could likewise be used for
the variant definition.)