Timeline for answer to Fibonacci Exponents by Roman Czyborra
Current License: CC BY-SA 3.0
Post Revisions
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2017 at 9:12 | comment | added | Roman Czyborra |
More precisely: 2 lists of numbers. Substituting [a..b] for (a,b) and postfix ?f for prefix o seems as cognitively reasonable as substituting a#b or o a b for o(a,b) to me.
|
|
| Jan 6, 2017 at 9:06 | comment | added | Roman Czyborra |
You mean: 2 lists of numbers. I thought a#b went too far.
|
|
| Jan 6, 2017 at 1:13 | comment | added | nimi | I think this goes too far. The input are two numbers (not necessarily as a pair, two separate arguments will do), but you're feeding a list of numbers and a function to your main function. | |
| Jan 5, 2017 at 10:01 | history | edited | Roman Czyborra | CC BY-SA 3.0 |
point-freed 7 bytes
|
| Jan 5, 2017 at 9:52 | comment | added | Roman Czyborra |
Alrightie already, that brings us up to par with the ECMAscript7 lambda. But if we are allowed to feed (a,b) as a?b then why aren't we allowed to prepare it as immediate [a..b]?f onto (?)=sum.zipWith(^)?
|
|
| Jan 5, 2017 at 9:40 | history | edited | Roman Czyborra | CC BY-SA 3.0 |
uncounted trailing newline
|
| Jan 4, 2017 at 20:29 | comment | added | nimi | Many other answers take two separate arguments, so I think it's fine. | |
| Jan 4, 2017 at 11:11 | comment | added | Roman Czyborra | Had considered infix like a…b but read the requirement to accept unary (ℤ,ℤ)→ℕ | |
| Jan 2, 2017 at 23:49 | comment | added | nimi |
You can turn the function o into an infix operator, like a#b=sum....
|
|
| Dec 31, 2016 at 20:36 | review | Low quality posts | |||
| Dec 31, 2016 at 20:39 | |||||
| Dec 31, 2016 at 20:18 | history | answered | Roman Czyborra | CC BY-SA 3.0 |