Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

The relevant programming paradigm is string/term rewriting, which is featured in other programming languages such as Pure. It seems to have few direct applications outside of symbolic computing itself, compilers and related fields such as PL theory. (Formal calculi and languages are often specified in PL theory as rewrite rules, even though the practical implementation may ultimately differ.)


Indeed, I think I messed up the language name too.

It was Kernel that was most similar with the fexpr capability.

Pure is a good example too.

https://web.cs.wpi.edu/~jshutt/kernel.html




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: