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

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: Functions from datasorts to datasorts

My one example, serialization of nested records from a tlist of @(string,t0ype), turned out to not need append. Anyhow, that's blocked for now, since I don't think you can reflect a template-argument string literal to the value level. But more generally, a convenient way to write functions

Re: Functions from datasorts to datasorts

2018-04-09 11:35 GMT+06:00 Andrew Knapp : > Is it possible to write (proof) functions from datasorts to datasorts? For > example, if we have > > datasort tlist = > | tnil > | tcons(t0ype, tlist) > > it would be nice to write something equivalent to > > tlist_append :