In Modula2 and Beads, the dependency graph is triv...
# thinking-togethere
Edward de Jong / Beads Project
07/21/2019, 8:32 PMIn Modula2 and Beads, the dependency graph is trivial to construct because imports are required to be at the start of the program, so a typical program doesn't need a makefile. In Red they use the clever trick of allowing compilation in the language itself, and since there is compile time execution in Red, a makefile is just a Red program. A very elegant solution. I personally despise all the horrible make systems like Gradle, Ant, Leiningen, etc. which are very complex and a horrible additional burden to a learning programmer.
đź‘Ť 4
j
Josh Marinacci
07/22/2019, 4:59 PMooh. what’s Red? I haven’t heard of that one.
e
Edward de Jong / Beads Project
07/22/2019, 6:55 PMRed is the rebirth of Rebol. A very powerful language, it is on the spreadsheet as one of the emerging languages. It has a very unusual syntax. Very compact.
j
Josh Marinacci
07/22/2019, 8:06 PMlink?
Josh Marinacci
07/22/2019, 8:06 PMit’s not this, is it? http://noderedguide.com/
e
Edward de Jong / Beads Project
07/23/2019, 9:03 PMwww.red-lang.org is the link to start with.
Edward de Jong / Beads Project
07/23/2019, 9:08 PMRed is the work of Nenad Rakocevic, who took an old language called REBOL and rebooted it, with various improvements. It is a language that lets you create domain specific languages and then program in your own dialect. So it has some FORTH flavor in that regard. For doing text parsing types of projects, only ICON can beat it. But it also has a system variant that generates executable files, and with the graphics module you can make applications. Anyway it is a substantial project that will generate a sizable audience.
2 Views