I should add that Nim still still has a 'separate language' for types, so doesn't quite fit OP's bill. Nevertheless, it's quite easy to build type constructs us

I should add that Nim still still has a 'separate language' for types, so doesn't quite fit OP's bill. Nevertheless, it's quite easy to build type constructs using statically resolvable expressions. I'd love to know if anyone could reproduce the N-queens example in Nim: https://www.richard-towers.com/2023/03/11/typescripting-the-technical-interview.html https://www.richard-towers.com/2023/03/11/typescripting-the-... I believe it is possible, but don't have the time to try it out. > The Nim compiler includes a simple linear equation solver, allowing it to infer static params in some situations where integer arithmetic is involved. From: https://nim-lang.org/docs/manual_experimental.html#concepts-generic-concepts-and-type-binding-rules https://nim-lang.org/docs/manual_experimental.html#concepts-...