GraNoLa/M is a Graph-Node-based Language (possibly for Machines.) It was one of my submissions for the Esoteric Awards. Not unlike Tamerlane, its execution model involves both traversing and rewriting a graph at the same time.
Submitted to Competitions
- Esoteric Awards (no prize)
Sample Program
a=^sajalom(b=^#d(c=^bimodang(^a))d(e=^#cthulhu(f=^uwaming(g=^ubewic()))))
Programming Paradigms
Documentation
Implementations
-
granolam.erl, an interpreter in Erlang
To run this implementation, you need:
-
to build it first, for which you will need:
- an implementation of Erlang (we suggest Erlang/OTP R13B)
-
to build it first, for which you will need:
Download
Development
Github: catseye/GraNoLa-M
Bitbucket: catseye/granola-m
Issue tracker: on github