It sounds like you know what you’re doing but the documentation seems rather shallow and I don’t quite get it. I think you’re going to need a real language specification. I like how Go does it.<p>There is some apparently AI-generated prose that needs rewriting for clarity. For example, in the tutorial:<p>> The caller proves where; the implementation proves ensures. A precondition failure stops compilation before any program runs.<p>Fron the readme:<p>> I think you get it now.<p>Nope, I skimmed, because the syntax is unfamiliar.<p>> Memory model is in a tree of "planes". The stack is a tree. Each function is a node. Each variable is another node. If it's a struct then it's also a node. Down to the most atomic types, which are just the integers.<p>Meaning what? This needs to be explained better.
Sorry for the non constructive comment:<p>I wish we would stop xxx::yyy::zzz for namespace.<p>It was horrible in C++ from day one, and is still horrible in Rust.<p>It had some reason to be this way in C++ but not in any other newer language.<p>Real negative part: it looks to me that the authors of those languages are parroting other languages rather than understanding the reason of those language choice.<p>This simply worries me because I judge the level of expertise and makes me not consider the language in the first place.<p>(I know C++ and Rust are alive but they share their fair share of poor design choice)
> it looks to me that the authors of those languages are parroting other languages rather than understanding the reason of those language choice.<p>I don't mean this to sound combative, but I think you are the one who doesn't understand the reason for the language choice. I assume you're objecting to the fact that these languages use different operators for module/namespace paths (`::`) and object member/method access (`.`), not the `::` symbol specifically.<p>You seem to assume that Rust blindly imitated C++, but that's not the case. The `::` syntax allows the compiler to identify and resolve all the static paths before any type inference or other analysis. This is important because macros are expanded between these stages, and can in turn introduce more static names which must also be resolved before any further compilation.<p>You might be able to introduce a rule that any `.`-path that <i>can</i> be resolved statically will be, trumping any non-static members (or maybe not, it might cause ambiguities I'm not thinking of), but Rust's stated design philosophy favors explicitness.<p>I don't know what this language's reason for using it was, as I don't see any mention of macros. But in general it simplifies compiler design. If you can resolve all the static names up front, the following compiler stages can ignore the concept of namespaces altogether.
I <i>assumed</i> Evergreen blindly imitated Rust.<p>However, I <i>believe</i> Rust purposely imitated C++, for reasons. And I still don't like it.<p>A lot of language are doing fine using dots. And if you are going to use '::' you can have your reasons. I would still find it annoying to type and read.<p>Just to add precision: I critic the syntax (which is very subjective), and I critic the parroting, as two separated arguments.
> A lot of language are doing fine using dots.<p>I have implemented one such language, and while it is indeed doing fine, the dots-everywhere syntax really does complicate name resolution. It only uses it because the distinction between two different operators would be lost on its intended less-technical audience. It is a (in my opinion unfortunate) tradeoff made for a specific reason.<p>And one thing those languages all (as far as I know) have in common is that they do not have Rust's macro system. It may well be impossible to implement that without a distinct operator.<p>I have no opinion as to whether that operator should be `::` or some other arbitrary symbol, but I believe that no matter what symbol they chose, someone would complain that it doesn't fit their personal taste. Can't please everybody.
> It was horrible in C++ from day one, and is still horrible in Rust.<p>I don't get it. Is it <i>syntactically</i> horrible or are there real reasons that I'm missing?
No it's just a personal opinion. I like the UX of using dots for everything.
For me, I guess it’s just that foo/bar is standard and fewer characters so it’s the obvious and ergonomic choice. But we can’t use that because of infix math, which is also a choice. So why are the choices made that way? “We made it easier to write mathematical notation at the expense of making it worse to talk about every namespace” isn’t the best trade off all the time.
Any links to the historical reason for C++ using ::?
I don't have a link but you can search on the web. I have the .pdf on my computer.<p>From "A History of C++: 1979− 1991".<p>> In C with Classes, a dot was used to express membership of a class as well as expressing
selection of a member of a particular object. This had been the cause of some minor confusion and could also be used to construct ambiguous examples. To alleviate this, :: was introduced to mean membership of class and . was retained exclusively for membership of object.<p>It was taken from Algol68.<p>Then, this was reused for namespaces for consistency reason.
My favorite namespacing syntax is ironically Clojures. module/func or fully.qualified.module/func or just func if you explicitly import the symbol. I vastly prefer shallow namespacing (module/func) most of the time.<p>I write Rust mostly for my day job (and it's also my preferred language on the side these days), so I usually end up explicitly importing all the symbols I actually use because module::func is just additional noise in an already pretty verbose language and is what's considered 'idiomatic'.<p>I don't really get the issue with :: being the separator used here. It's slightly ugly, but it's visually distinct from . for field access, which I do appreciate.
This is good feedback. I will chew on this…
Don't think too much about it though, it was to express a personal opinion.<p>I just like "dots" for everything, and there are some reasons to distinguish package/module qualification, struct/class member access (.), or static member access (::).
Hard agree. PHP did it right with backslashes.
This language has been something I've wanted to build for years. For a while I thought I'd get my PhD and build it there. But now it's very possible to have Claude build it while I'm at work and give it intense code review every day. It's still not in a "useful" place yet, but I'm curious what fellow programmers think of a language like this. If I continue work is this something anyone thinks they'd enjoy using? Would love some feedback, thanks!
It's a really great concept. What guarantees are made by the prover?<p>Success in programming languages is not simply if-you-build-it-they-will-come. Bootstrapping a community that loves programming in it is the hard part. You'll either need a killer interop story with an already built ecosystem, or you'll need your own HTTP server, JSON parser, etc. etc. etc.<p>Best of luck! I'll watch this space.
Thanks! The guarantee is that, without the use of trustme (which can prove any fact), you cannot address memory as the wrong type. The compiler also ensures that a pointer/reference to a value is live at compile time, so it’s not possible to create an invalid pointer (without the use of trustme). You can also claim any fact which the compiler must prove in order to continue compilation.<p>That is good advice, I’m definitely planning on including some batteries soon, once I’m very happy with where the compiler is at.
This isn't so much directed at you, as other people that get inspired by this. I have been working on my own Rust like language with claude for a few months and there are a _lot_ of projects like that out there.<p>Mine has a formally proven borrow checker built on linear types, along with algebraic effects, with an LLVM compiler written in lean -- the type checker uses exactly the proven calculus.<p>If you are going to build a language with claude, I highly, highly recommend writing it in Lean or Coq and starting by formalizing a pre-existing paper or system that has the properties you want.<p>Claude gets confused and takes shortcuts constantly, and if you don't have a proven base, you are really going ot struggle. I had to throw away months of work as i got bogged down trying to resolve special cases and bugs that just evaporated when i switched to a proven calculus.
Is your language available anywhere? I'd be curious to check it out. I strongly believe that there will eventually be a new language created with agents in mind as the primary consumers, and making the foundations provable / safe are key cornerstones in my mind. The other property that I think is very important is fast tooling / compilation. Compilation speed is not generally the bottleneck right now in agent loops, but models can get faster, and as software scales up and is written by swarms of agents in concert, making the tools run really fast will be an important way to decrease cycle time and increase speed.
It's so strange how much effort goes into producing a language that people don't even intend to write.
To me it’s about determinism and feedback. Agents will make mistakes but if they get clear feedback from the tools they use, they will produce a good result.<p>There are a shrinking number of reasons to geenfield projects with non-strict or unsafe languages now.
What's strange is only seeing value in manually writing code when clearly AI is very useful to produce quality code here.
you can ask ai to write code in existing languages with large training sets, and it'll do better because of the large volume of training data.<p>if you're all-in on ai, you want to prioritize familiarity for agents.
The objective of this project isn't to make a language fit for AI to write but to make a "probably safe system language" regardless of who's doing the coding.
That would imply the AI should write every program in Python from now until the end of time; but just because the AI is most familiar with Python doesn’t mean we have to throw everything we know about system design and using the right tools for the job out of the window.
That's basically SPARK (the Ada subset) but with c-like syntax (more or less).
Is this just "Rust with dependent types"? Not saying that as a criticism, I think this is genuinely useful.
Dependent types are part of it, yeah! There are definitely some things I dislike about Rust which I am not planning on including, mainly lifetimes and some ways they handle pointer mutability. One thing I particularly dislike about Rust is:<p>let x = vec![1,2,3];
let a = &mut x[0];
let b = &mut x[1];
swap(a, b);<p>This is not allowed. And actually in the compiler’s mind it’s for the same reason as this:<p>let x = vec![1,2];
let a = &mut x[0];
x.push(3);
<i>a = </i>a + 1;<p>Which is definitely not safe and should be rejected. But the compiler cannot reason that the above case is actually safe, because they both fail to compile for lifetime reasons.<p>Another thing I’m working on are “patterns” which are like enums on steroids. In Rust you cannot define how an enum is laid out, thus requiring optimizations for types like Option<&T> to be in the compiler. In evergreen this will be in the language via a similar process to trait implementation.
> not planning on including, mainly lifetimes and some ways they handle pointer mutability<p>How are you going to solve the problem with other means? Lifetimes basically guarantee, that there are no use-after-free bugs.
The compiler statically tracks “where” everything lives. It also knows “when” the “where” is valid.<p>Each “where” is called a plane, which is a tree. The stack plane contains all your function calls memory, a structure allocated on the stack has a child plane for each field. The compiler tags which plane something is from at compile time and tracks when it dies.<p>Things do get complicated in scenarios like:<p>fn max(a: &usize, b: &usize) -> &usize {<p><pre><code> if *a > *b { a } else { b }
</code></pre>
}<p>In such a scenario the compiler tags the result with both of the input planes. However, you cannot define add a postcondition ensures clause to make it more precise
Sounds a lot like group borrowing from Valen, but that one still has annotations like `entity in world.entities[] mut`. Are you tracking the same things implicitly with post conditions?
And what about allocations and threads?
Allocations live in their own plane, the root allocated typed being the root node of that plane. For threads, I’m still working on that, don’t have a super cool answer yet
Since you are replying, I’ll go ahead and you answer…<p>In a sibling comment I said the types seem more likely to be refinement (or Liquid) types instead of being full-spectrum dependent types. Is this correct? I certainly haven’t been through enough of the docs to be confident, but I took a swing when I posted my comment.
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.
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.
Yeah it definitely looks like refinement vs actual dependent types. I do the same thing here[1] in my language (pardon the mess). Adding liquid types to basically rust is IMHO a good idea.<p>[1] <a href="https://march-lang.org/docs/refinement-types/" rel="nofollow">https://march-lang.org/docs/refinement-types/</a>
I didn't delve too deeply, but I don't get it. How do you get provable <i>runtime</i> safety (in a dependent types sense) in a system which gives you direct control over memory, and without introducing the kind of overhead that would be inappropriate for a systems language?<p>Your "overflow, then inspect" example illustrates this incoherency. If overflow is allowed, and you try to fit 250 + 10 into a u8, so the value should be 4, which <i>is</i> less than 10, so it should fit your precondition, not violate it. And this is a simple example where 250+10 is known at compile-time - what happens when a user provides the number at run-time? Does the compiler attempt to provide the proof anyway? How?<p>I mean.... I have a lot of respect for Haskell and Idris and the goals they set out. But they're not <i>systems</i> languages.