Timeline for How does the map function work in stack-based languages?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 17, 2023 at 1:44 | history | bounty ended | Michael Homer♦ | ||
| S Nov 17, 2023 at 1:44 | history | notice removed | Michael Homer♦ | ||
| S Nov 16, 2023 at 0:54 | history | bounty started | Michael Homer♦ | ||
| S Nov 16, 2023 at 0:54 | history | notice added | Michael Homer♦ | Reward existing answer | |
| Nov 14, 2023 at 9:32 | vote | accept | alephalpha | ||
| Nov 14, 2023 at 8:48 | answer | added | alephalpha | timeline score: 5 | |
| Nov 13, 2023 at 23:27 | comment | added | user23013 | Many golfing languages just invent different high-order functions for functions with different arity. And the problem is there are many of them, mapping each to each, mapping one to each, and just reduce, without a most sensical default. If you want it not too restrictive, it might be better to start at binary operators and extend it to ternary, thinking unary a degenerated case. | |
| Nov 12, 2023 at 14:48 | history | became hot network question | |||
| Nov 12, 2023 at 8:11 | answer | added | Michael Homer♦ | timeline score: 8 | |
| Nov 12, 2023 at 6:47 | history | asked | alephalpha | CC BY-SA 4.0 |