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

simpler wording

Browse Source
This commit is contained in:
Victor Taelin 2024-05-16 14:21:52 -03:00
parent f9d308c467
commit 66a8be1c33
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
README.md
View File

@ -111,12 +111,11 @@ def main:
return render(16, demo_shader)
```
And it would actually work (!!!). Even highly involved recursive algorithms,
such as this [Bitonic Sort based on tree rotations](examples/bitonic_sort.bend),
parallelizes linearly on Bend. Long-distance communication is performed by
*global beta-reduction* (as per the [Interaction
Calculus](https://github.com/VictorTaelin/Interaction-Calculus)), and
synchronized correctly and efficiently by
And it would actually work. Even involved algorithms, such as a [Bitonic Sort
using tree rotations](examples/bitonic_sort.bend), parallelize well on Bend.
Long-distance communication is performed by *global beta-reduction* (as per the
[Interaction Calculus](https://github.com/VictorTaelin/Interaction-Calculus)),
and synchronized correctly and efficiently by
[HVM2](https://github.com/HigherOrderCO/HVM)'s *atomic linker*.
- To jump straight into action, check Bend's [GUIDE.md](https://github.com/HigherOrderCO/bend/blob/main/GUIDE.md).