refal-5-lambda VS ShnooTalk

There were number of innovative but relatively obscure languages that came out of the first wave of cybernetics. Glushkov, one of Lyapunov's contemporaries who made a number of significant contributions to automata theory, created a language called Analytik [1], with early support for linear algebra and symbolic differentiation. REFAL is another language that emerged from the same era and still under active development [2]. At its foundation is an alternative and surprisingly rich algebraic theory of computation based on so-called word problems [3].

[1]: https://link.springer.com/content/pdf/10.1007/BF01070461.pdf

[2]: https://github.com/bmstu-iu9/refal-5-lambda

[3]: https://en.wikipedia.org/wiki/Word_problem_for_groups

Thanks! The semantic analyzer can query the builder to check if a function/type exists, find functions matching a particular signature, retrieve names of all fields given a struct others. You can find the "API" for such operations here.

I have started working on a standard library for my language called ShnooTalk. ShnooTalk is a statically typed compiled language that uses LLVM as the backend. ShnooTalk has its own custom IR definition that is than translated to LLVM IR.

GitHub: https://github.com/RainingComputers/ShnooTalk

I have been working on my programing language called ShnooTalk.