From F to DOT: Type Soundness Proofs with Definitional Interpreters · HackerPapers discussions

From F to DOT: Type Soundness Proofs with Definitional Interpreters — mentioned by virtualwhys

Fri, 13 Nov 2015 16:57:48 GMT

That would be Dotty[1]. It's the same language as Scala but with union and intersection types, and some extraneous features stripped out (e.g. procedure syntax, XML, and `for some` types). Under the hood it's a complete overhaul, based on the DOT calculus[2][3]. Already compile times are faster than current Scala (without any optimizations applied), and tooling will improve as well (Dotty fuses current Scala's type parameter and type member implementation into one, thus less work for IDE presentation compilers to do, for example). Implicits aren't going anywhere, thankfully, how else could…

Paper and discussion history. A mention is not an endorsement.

From F to DOT: Type Soundness Proofs with Definitional Interpreters — mentioned by virtualwhys

Sat, 24 Oct 2015 19:41:37 GMT

Paper is here[1] [1] http://arxiv.org/pdf/1510.05216v1

Paper and discussion history. A mention is not an endorsement.

From F to DOT: Type Soundness Proofs with Definitional Interpreters — HN submission

Sat, 24 Oct 2015 19:40:18 GMT

From F to DOT: Type Soundness Proofs with Definitional Interpreters

2 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.