"A (Not So Gentle) Introduction To Systems Programming In ATS" by Aditya Siram

Channel:Strange Loop Conference · Length:36:58 · Published:2017-09-30 · Views:25734

Watch on YouTube

Summary

Aditya Siram introduces ATS, a statically typed ML-like language that compiles to C and offers type-safe pointer arithmetic and a full proof language. The Strange Loop talk shows off C interop, concurrency and verification features with non-trivial examples.

Why HN recommends it

Cited in Rust and systems-language threads as the best introduction to ATS, a language claimed to go beyond Rust's safety guarantees.

I recommend watching this presentation for a good idea of what ATS programming is like — HN, 2020

Programming language design · C, C++, Rust, Go & systems languages · Logic & formal methods

Subtitles (excerpt)

so welcome to my talk on systems programming in 80s so before I start with like ATS syntax or how things work anything like that here's the elevator pitch for ATS it's an ml but it's not a standard ml but it's got algebraic data types and pattern matching and all that good stuff functional programming is fully supported because tail calls are actually optimized in ATS and it actually also supports mutual recursion but the thing that I think that ATS really brings to the table that sets it apart from all the other languages is exactly the same performance and memory predictability of C notice I didn't say that it runs as fast as C or uses as little memory of C I'm making a stronger statement than that I'm saying you have the exact same control as C all that stuff that you do in C pointer arithmetic allocating D allocating freeing stack allocation all of that stuff that comes back but there's this whiz-bang type system that makes all that safe so if you use the type system right you'll never walk off the end of an array you will never double free something you will never have dangling stack pointers and you will always free all your resources and I think that's a really powerful thing to have it just D

On Hacker News

Some entertaining talks introducing the language, by /u/deech: "A Tase Of ATS" at Compose Conf 2019: [LINK] "A (Not So Gentle) Introduction To Systems Programming In ATS" at Strange Loop 2017: [VIDEO] — rtfeldman, 2021-08
Yes, ATS can guarantee all those things and more. In particular, ATS allows you to write "unsafe" code, which you then prove safe with a mechanically verified proof. This is in contrast to unsafe Rust, which depends on programmer discipline, and has no (intra-language) mechanism for verification beyond the basic type system. You could say that Rust is all-or-nothing, while ATS allows gradual veri… — Athas, 2020-08
If you are interesting in a programming language suitable for system level programming, and using proving techniques, maybe ATS would be of interest. [VIDEO] [LINK] — snaky, 2018-09
> Without these, you simply can’t have a fast, > memory-safe language: either you surrender > speed, by boxing everything, or you surrender safety. Not only can you have speed and safety without Rust's rigid enforcement of exclusive ownership, you can do even better--even faster and with even stronger security guarantees: [VIDEO] [LINK] — wahern, 2017-10
How many buffer overflows were involved in the Equifax leak? The ultimate solution to the problem is formal verification. Rust solves this for buffer overflows, but nothing else. It's a one trick pony. Someone posted this interesting nugget on HN the other day: [VIDEO] Aside from some of the awkward ergonomics, its mechanism for formal specification looks brilliant. And you get to keep C's bag-of… — wahern, 2017-10

Related videos