[$] Two new graph-based functional programming languages

Functional programming languages have a long association with graphs. In the1990s, it was even thought that parallel graph-reductionarchitectures could make functional programming languages much faster than theirimperative counterparts. Alas, that prediction mostly failed to materialize.Even though graphs are still used as a theoretical formalism in order to defineand optimize functional languages (such as Haskell'sspineless tagless graph-machine), they are still mostly compiled down to the same oldnon-parallel assembly code that every other language uses. Now, twoprojects -Bend andVine - have sprung up attempting to change that, and prove thatparallel graph reduction can be a useful technique for real programs.