I have been considering BitC's goals recently and wondering if they might be fulfilled by the language ATS.
ATS has good compilers, a reasonably trendy syntax (similar to Agda), and the best C integration I've seen in a long time. It also has a fairly low-level view of data types and mutation, closures, as well as dependent types, linear types, and even an interactive proof system. What does BitC provide that ATS doesn't? -- William Leslie _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
