Re: Functions from datasorts to datasorts

I think I understand you mean here. In ATS3, I plan to have an evaluator for evaluating compile-time constant expressions. This evaluator can evaluate an expression like tlist_append(constant1, constant2). Of course tlist_append needs to be defined at the sort level first. On Mon, Apr 9, 2018 at

Re: ATS3: ATS/Xanadu

I'm actually not a huge fan of Scala syntax, simply because I find it verbose and I believe that it is not suited to functional programming in general. If there are reasons to support methods and whatnot, then I would be more amenable to it. As for build systems, I think that shake

Re: ATS3: ATS/Xanadu

>>As for build systems, I think that shake is probably good to have ... That would be great! I plan to export the syntax tree of an ATS program into JSON. >>On the ATS front: I am curious as to how ATS optimizes tail recursion. I know Scala doesn't actua