[JohnStrange]

Having programmed many substantial projects in both worlds, I have to admit that I much prefer S-expressions over any other syntax -- without complicated macros that introduce some sort of keywords or other tricks. With S-expressions, there is basically just one syntax to learn for every construct, so you can focus on the semantics. (I do prefer Scheme's way of dealing with functions, but that's another matter, of course.)

Unfortunately, I otherwise prefer strongly typed systems languages with a strong focus on compile-time, zero cost solutions such as Ada or Rust. My ideal language would be a very fast, statically and strictly typed language with a modern incremental garbage collector that can be switched off and without type inference, but with an S-expression syntax.

However, if such a language existed or I'd develop it on my own, it probably wouldn't gain much popularity... ;-)

[qwertyuiop924]

Shen is probably the closest you'll get. http://shenlanguage.org

It's strongly typed, but not a systems language, and very much not zero-cost.

There are some systems lisps with no GC. I just wish I could find them...

[chriswarbo]

A notable Lisp without GC is Linear Lisp http://home.pipeline.com/~hbaker1/LinearLisp.html

[qwertyuiop924]

...Hang on a second, that sounds a heck of a lot like NewLisp's memory management model, with the disadvantages thereof.

[defgeneric]

There's also Carp: https://github.com/carp-lang/Carp

[qwertyuiop924]

You may also wish to try PreScheme. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.40...

[mrkgnao]

Ooh, that math reference.

[kazinator]

With List you know that no matter what semantics someone invents, you are not going to have to struggle with its syntax (too).