Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Fix typo | Matias Kinnunen | 2024-06-10 |
| | |||
* | it's → it is | Lars Kappert | 2024-05-03 |
| | |||
* | Increase consistency and readability a tiny bit | Lars Kappert | 2024-05-03 |
| | |||
* | Format | Louis Pilfold | 2024-04-19 |
| | |||
* | separate case | 0riginaln0 | 2024-04-15 |
| | |||
* | separate case | 0riginaln0 | 2024-04-15 |
| | |||
* | factorial(0) = 1 case added for tail_calls | 0riginaln0 | 2024-04-15 |
| | | | Executing a factorial from zero is expected to return one, not "RangeError: Maximum call stack size exceeded" | ||
* | factorial(0) = 1 case added for recursion | 0riginaln0 | 2024-04-15 |
| | | | Executing a factorial from zero is expected to return one, not "RangeError: Maximum call stack size exceeded" | ||
* | Add hrefs to code keywords | Dimitrii Dulgher | 2024-04-15 |
| | |||
* | Update pattern aliases en.html to match the code example | Vladimir Kidyaev | 2024-03-12 |
| | |||
* | Clarify list recursion text | Anthony Bullard | 2024-03-05 |
| | | | The first sentence in this section is hard to parse. I think this rephrasing is more clear. | ||
* | text -> en | Louis Pilfold | 2024-02-19 |
| | |||
* | Fix typo | Daren Chandisingh | 2024-02-15 |
| | |||
* | Fix simple typos in lessons (#19) | Simon Johansson | 2024-01-30 |
| | |||
* | Correct mismatched code | Louis Pilfold | 2024-01-23 |
| | |||
* | Correct other code | Louis Pilfold | 2024-01-23 |
| | |||
* | Fix "called called" in pattern matching | Wesley Moore | 2024-01-20 |
| | |||
* | Various fixes | Louis Pilfold | 2024-01-18 |
| | | | | Thank you @giacomocavalieri! | ||
* | Remove paragraph covered by previous lesson | Louis Pilfold | 2024-01-18 |
| | |||
* | Move recursion lessons together | Louis Pilfold | 2024-01-18 |
| | |||
* | Remove ` | Louis Pilfold | 2024-01-18 |
| | |||
* | Guards | Louis Pilfold | 2024-01-02 |
| | |||
* | Add chapters | Louis Pilfold | 2023-12-21 |