Timeline for Making an acronym
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Mar 15, 2016 at 9:57 | history | edited | flawr | CC BY-SA 3.0 |
deleted 85 characters in body
|
| Mar 15, 2016 at 9:56 | history | undeleted | flawr | ||
| Mar 15, 2016 at 9:56 | history | deleted | flawr | via Vote | |
| Mar 15, 2016 at 9:55 | comment | added | flawr | Now this is definitely over my head, I'm going to have to learn quicker=) | |
| Mar 13, 2016 at 22:06 | comment | added | nimi |
Switching back to non-pointfree and a list comprehension is even shorter: a x=[h!!0|h<-w$toUpper<$>x,notElem h$w"OF BY OR AND"].
|
|
| Mar 13, 2016 at 21:07 | comment | added | nimi |
chapter 6 of Learn you a Haskell for Great Good! has a good introduction to function application with $ and composition with ..
|
|
| Mar 13, 2016 at 19:35 | history | edited | flawr | CC BY-SA 3.0 |
added 34 characters in body
|
| Mar 13, 2016 at 19:34 | comment | added | flawr |
Oh, that . composition operator looks quite intuitive. I am just never sure what is evaluated in what order.
|
|
| Mar 13, 2016 at 12:53 | history | answered | flawr | CC BY-SA 3.0 |