Hello! :)<p>a) We will release it to the first group of alpha testers in couple of weeks from now. This will be couple of weeks, not couple of months.<p>b) We&#x27;re going the Haskell route - we allow for non-total functions, and we will extend Luna&#x27;s type-checker to understand as much as possible. In fact we treat type level very similar to the value-level, very similar to the type of types - level, etc, so there could be functions evaluated at compile-time and they could cause infinite loop. Please note that although we design Luna in order to be fully dependent type language, the compiler just hit the alpha stage and there is much more work to be done in this field.<p>c) The standard AST is really <i></i>very<i></i> extensible. In fact every term that belongs to AST is just different data type. We&#x27;ve written a library in Haskell that allows handling open sum types using all the type-level machinery to help it be bullet-proof. Luna will incorporate a library that allows you to change and manipulate the AST from within a language - something like TemplateHaskell, but without the stage restriction known from GHC. This is not available at the moment though. I doubt though you will ever need to extend the AST using a plugin, because it allows to express <i>really</i> wide logic, however I&#x27;m very interesting what idea do you have in your mind here! :)