This list of wanted language features is quite interesting.
> A serious take on a contract-based language
As the article itself notes Clojure does support contracts in the language and with libraries. But there has been a ton of research about that, e.g. JML [1].
> A language with semantic relations
They can be expressed in contracts (e.g. Clojure) or with property-based test frameworks (e.g. Haskell, Clojure, and many others nowayday).
> Everything is a Graph
See graph rewriting, e.g. [2]. That was just my first google hit with the proper search term.
> A better calculator language
That idea looks to me like automatic transformation from offline to online algorithms [3]. I am not aware of any compilers being able to do that. But dataflow graphs can be used to design such systems. A list of such languages or libraries (e.g. for Clojure) can be found in this Stackoverflow article [4]
> A really dynamically-typed language
As some other answers here already mentioned modern static type systems are able to express, new types
at runtime, e.g. with Scala's path dependent types. Again Clojure has an interesting entry here: clojure.spec [5], a runtime represented specification language, which can be used together with contracts or to formulate proeprty-based tests, or anything else you would like to do with it.
Btw, I've only toyed with Clojure so far and I used to be an avid proponent of Haskell/ML-style static type systems.
> A serious take on a contract-based language
As the article itself notes Clojure does support contracts in the language and with libraries. But there has been a ton of research about that, e.g. JML [1].
> A language with semantic relations
They can be expressed in contracts (e.g. Clojure) or with property-based test frameworks (e.g. Haskell, Clojure, and many others nowayday).
> Everything is a Graph
See graph rewriting, e.g. [2]. That was just my first google hit with the proper search term.
> A better calculator language
That idea looks to me like automatic transformation from offline to online algorithms [3]. I am not aware of any compilers being able to do that. But dataflow graphs can be used to design such systems. A list of such languages or libraries (e.g. for Clojure) can be found in this Stackoverflow article [4]
> A really dynamically-typed language
As some other answers here already mentioned modern static type systems are able to express, new types at runtime, e.g. with Scala's path dependent types. Again Clojure has an interesting entry here: clojure.spec [5], a runtime represented specification language, which can be used together with contracts or to formulate proeprty-based tests, or anything else you would like to do with it.
Btw, I've only toyed with Clojure so far and I used to be an avid proponent of Haskell/ML-style static type systems.
[1]: https://www.cs.ucf.edu/~leavens/JML/index.shtml
[2]: https://link.springer.com/chapter/10.1007/978-3-642-32211-2_...
[3]: https://en.wikipedia.org/wiki/Online_algorithm
[4]: https://stackoverflow.com/questions/461796/dataflow-programm...
[5]: https://clojure.org/guides/spec