mirror of
https://github.com/HigherOrderCO/Bend.git
synced 2024-09-11 03:45:29 +03:00
[sc-684] Update dictionary for guide.md
This commit is contained in:
parent
3a6c746fd6
commit
f0cc9dd2d8
6
GUIDE.md
6
GUIDE.md
@ -325,7 +325,7 @@ be turned into a tree!
|
|||||||
|
|
||||||
The `bend` is the opposite of the `fold`: instead of consuming something, it
|
The `bend` is the opposite of the `fold`: instead of consuming something, it
|
||||||
creates something. The way it works is, in some ways, similar to a while loop,
|
creates something. The way it works is, in some ways, similar to a while loop,
|
||||||
but, admitedly, a little bit more bureaucratic, in 3 ways:
|
but, admittedly, a little bit more bureaucratic, in 3 ways:
|
||||||
|
|
||||||
1. You must explicit an initial state.
|
1. You must explicit an initial state.
|
||||||
|
|
||||||
@ -376,7 +376,7 @@ itself, forming a tree of descendants. In the end, you have a complete tree!
|
|||||||
|
|
||||||
The second way to explain is for the devs offended by this ultra simplified
|
The second way to explain is for the devs offended by this ultra simplified
|
||||||
example: yes, `bend` is just a syntax-sugar for creating a recursive function,
|
example: yes, `bend` is just a syntax-sugar for creating a recursive function,
|
||||||
immediatelly calling it, and assigning the result to a variable. In other words,
|
immediately calling it, and assigning the result to a variable. In other words,
|
||||||
the program above is equivalent to:
|
the program above is equivalent to:
|
||||||
|
|
||||||
```python
|
```python
|
||||||
@ -504,4 +504,4 @@ Benchmarks:
|
|||||||
|
|
||||||
## ...
|
## ...
|
||||||
|
|
||||||
TODO: conver IO and so many other aspects :')
|
TODO: cover IO and so many other aspects :')
|
||||||
|
@ -9,6 +9,7 @@
|
|||||||
"arity",
|
"arity",
|
||||||
"behaviour",
|
"behaviour",
|
||||||
"bitand",
|
"bitand",
|
||||||
|
"Bitonic",
|
||||||
"builtins",
|
"builtins",
|
||||||
"callcc",
|
"callcc",
|
||||||
"chumsky",
|
"chumsky",
|
||||||
@ -24,6 +25,7 @@
|
|||||||
"destructures",
|
"destructures",
|
||||||
"desugared",
|
"desugared",
|
||||||
"desugars",
|
"desugars",
|
||||||
|
"devs",
|
||||||
"dref",
|
"dref",
|
||||||
"dups",
|
"dups",
|
||||||
"effectful",
|
"effectful",
|
||||||
@ -58,6 +60,7 @@
|
|||||||
"nullary",
|
"nullary",
|
||||||
"numop",
|
"numop",
|
||||||
"nums",
|
"nums",
|
||||||
|
"OOM's",
|
||||||
"oper",
|
"oper",
|
||||||
"opre",
|
"opre",
|
||||||
"oprune",
|
"oprune",
|
||||||
@ -67,6 +70,7 @@
|
|||||||
"postcondition",
|
"postcondition",
|
||||||
"powi",
|
"powi",
|
||||||
"prec",
|
"prec",
|
||||||
|
"quadtree",
|
||||||
"readback",
|
"readback",
|
||||||
"recursively",
|
"recursively",
|
||||||
"redex",
|
"redex",
|
||||||
@ -111,6 +115,7 @@
|
|||||||
"/`.`/g",
|
"/`.`/g",
|
||||||
"/`..`/g",
|
"/`..`/g",
|
||||||
"/`...`/g",
|
"/`...`/g",
|
||||||
"/`....`/g"
|
"/`....`/g",
|
||||||
|
"/```.*\n.*\n```/g"
|
||||||
]
|
]
|
||||||
}
|
}
|
||||||
|
@ -84,7 +84,7 @@ impl<'a> PyParser<'a> {
|
|||||||
Expr::Tup { els }
|
Expr::Tup { els }
|
||||||
} else {
|
} else {
|
||||||
self.consume(")")?;
|
self.consume(")")?;
|
||||||
// A parenthesised expression
|
// A parenthesized expression
|
||||||
head
|
head
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user