P. Oscar Boykin
P. Oscar Boykin
One interesting idea would be the ability to make unions of enum branches. Like: ``` enum Foo: Bar, Baz, Quux def bar_baz(a: Bar | Baz): match a: case Bar: "bar"...
Pattern matching a bit poorer in strings because you can't match a single character.
Wax is a low-level lisp language that can emit code in many other languages. Compiling to wax could be a great intermediate language to reach many other backends. see https://github.com/LingDong-/wax/issues/14
the types were discarded when building the matchless AST. To generate monomorphic code, that seems like it was a mistake. We don't need it to generate python, js, or similar...
In a package import, `Foo as Bar` gets you the ability to talk about Bar as a type, constructor function, and in a pattern match. if you do `foo =...
One significant deviation of bosatsu from python is that we call "modules" by the name "package" and we normally write the package name into the file. Next, we deviate from...
We only allow substructural recursion in bosatsu, and the only way to get a substructure is to do a pattern match where we can verify that we have a substructure:...
Instead of a lambda being marked by `\` we would use `->` as a postfix operator to imply a lambda. This may be tricky for multi-arg functions: `\a, b, c...
In Bosatsu, like System F, the type `exists a. P` can be encoded as `forall b. (forall a. P -> b) -> b` We encode Mapped in this way, we...
Elm has very nice support for anonymous [records](https://elm-lang.org/docs/records). One thing you can do is updates that look like `{ foo | x = 1 }`. We could steal this idea...