HigherOrderCO/Bend
1
1
Fork 0
mirror of https://github.com/HigherOrderCO/Bend.git synced 2024-09-11 03:45:29 +03:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #347 from WarpWing/patch-1

Browse Source 
Minor grammatical mistakes in native-numbers.md
This commit is contained in:
Nicolas Abril 2024-05-18 13:48:06 +00:00 committed by GitHub
commit 98bf8fda79
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/native-numbers.md
View File

@ -108,7 +108,7 @@ The `0` case matches when `n` is 0, and the `_` case matches when `n` is greater
In the `_` arm, we can access the predecessor of `n` with the `n-1` variable.
We can also match on more than one value at once.
If we do that, we must necessarily cover the cases in order, starting from 0.
To do that, we must cover the cases in order, starting from 0.
```rs
Number.minus_three = λn λf λx
@ -121,7 +121,7 @@ Number.minus_three = λn λf λx
```
Using everything we learned, we can write a program that calculates the n-th Fibonacci number using native numbers
Using everything we learned, we can write a program that calculates the n-th Fibonacci number using native numbers:
```rs
fibonacci = λn // n is the argument
@ -153,4 +153,4 @@ Unlike with `switch`, you can match any number and in any order.
The variable pattern is used to match on all other numbers.
Unlike with `switch`, you can't directly access the predecessor of the number.
You can read [Pattern matching](pattern-matching.md) for more information about how pattern matching equations are converted to `switch` and `match` expressions.
You can read [Pattern matching](pattern-matching.md) for more information about how pattern matching equations are converted to `switch` and `match` expressions.