Re:Evergreen: A Provably Safe Systems Language
by throwaway17_17 on Wednesday November 04, 2026 @11:19AM
(#50367790)
The introductory examples look more like refinement type (or Liquid types) which are limited to those operations and restrictions one’s that are provable by the compiler utilizing a restricted subset of operations and computational constructs subject to deterministic proving via SAT solving. I’m going to look closer at the docs so I could be mistaken on that point. It certainly seems to have taken the ownership and ‘borrowing’ concepts for memory semantics from Rust at a quick glance at the first few pages.
[ Parent
| on HN ]
Re:Evergreen: A Provably Safe Systems Language
by jordan_bonecut on Wednesday November 04, 2026 @11:22AM
(#50367851)
Dependent types can be achieved via “ideal Generics”. Very undocumented and not ready to commit to how they work yet, but the basic idea is that a type can be generic on a value.
Re:Evergreen: A Provably Safe Systems Language
by ch4s3 on Wednesday November 04, 2026 @11:24AM
(#50367885)
How long have you been working on this?
Re:Evergreen: A Provably Safe Systems Language
by jordan_bonecut on Wednesday November 04, 2026 @11:31AM
(#50367990)
I have been building little prototype languages for years. This iteration which is heavily AI powered is a couple weeks old
Re:Evergreen: A Provably Safe Systems Language
by ch4s3 on Wednesday November 04, 2026 @11:40AM
(#50368138)
Oh cool, it's amazing how quickly you can stand up a language now, I love it. I'd love to exchange ideas, I really like what you're doing.
How are you doing resolution of your dependent(refined?) types? I've been using Z3, but you're clearly doing something else here.