wiki:Languages/IdealizedLanguage

an idealized language

On the syntax and semantics level it should be a modern ML.

In short, it should be Standard ML + Type Classes from Haskell (so Traits could be implemented, not the other way around (Type Classes are actually Type Traits!)) + compiler techniques from Rust + first class channels and select from Go with pattern matching everywhere, of course, so any code from Erlang could be easily tramspiled into it.

On implementation level it must be Go, of course. Just a straightforward compilation into native code + stdlib as thin layer on top of target OS (ideas from Plan9/Inferno).

The Rust's principle that there must not be any underlying C-based runtime (with all C-related problems) is more a meme than a real thing, since a kernel is still C or C++ and an OS is merely a user-visible (or user-level) interfaces to the kernel. Inferno's approach is more realistic.

And that is it.

In other words - not the Ruby's way of bootstrapping Rust (out of best parts of C++), but the Go's way (well-educated and experienced engineers instead of passionate amateurs) and out the best parts of ML and Haskell instead of C++.

Type system

Abstractly, types form a separate so-called static environment in which each value (including functions, which are values too) is associated to a type (possibly more than one). This is very similar to bindings (association of symbols to values) in so-called dynamic environment.

Since types live in a separate environment, type-annotations should form a separate, distinct sub-language, similar to an embedded DLS. Haskell's type-annotation for functions is the best example. The code is not cluttered and the type on any values could be easily checked at any time. Erlang has evolved a distinct DSL for typing.

Types must be inferred and being annotated only when it is absolutely necessary (to assist the type-checker when it is unable to infer algorithmically the type by itself - recursive functions is the canonical example). Functions shall be annotated to hint for their semantics, but an inferred type could be easily looked up and displayed by an editor. No fucking C++ or Java generics ever again.

A real-world type system inevitably evolves the notion of higher-order types (or types of types) so an ideal language must have higher-order types (like higher-order functions).

Whether or not to have functions on types is an open question, but to have constraints (asserts) and qualifiers (forall) on types is the must.

Not a better C

Do not begin with C, do not try to make a better C. Begin from Haskell (and Standard ML), try to make a better ML. All these better Cs (except Go) are fucking crap, including C++ (which is a tragedy), Java (which is a farce) and Javascript (which is a weak-typed farce or a farce of a farce - an insult and disgrace to Human Reason, second only to PHP4).

Last modified 14 months ago Last modified on Dec 19, 2018, 6:26:31 AM
Note: See TracWiki for help on using the wiki.