The smallest subset of a high-level programming language?

Question

Programming languages

By analogy with the minimum subset of operations sufficient for Turing completeness:
Is there a minimum set of built-in facilities for a high-level language with which to implement any other features that currently exist in any high-level language?
For example, C# has keywords asyncand yield return. What must exist in the language so that such functionality can be added as part of the standard library, and not built into the compiler?
My version - we need macros, anonymous functions with closures, pattern matching, generic types...

Answer 1

LISP

Answer 2

C++ without STL, iostreams and cstdlib is exactly what you are looking for.

Answer 3

Over time, I will learn this in practice. :-)

Answer 4

> Minimum subset
> With ++ it, to put it mildly, not the minimum subset. And before version '11, it didn't even have lambda expressions.
Weird logic. You ask about the minimum , but say that according to your C ++ this is not even the minimum . This is the same as saying that a Zhiguli is not a minimal subset, because it doesn’t even have the latest lighting system for hundreds of oil.
See asm. It's definitely minimal. Or prolog. This is the same as when you come to the Ministry of Finance and prove to them that the cost of living is 100k a day. What a minimalist you are . Hipster maybe?
Bottom line: minimalistic and applied is C and other haskel-lisps.

Answer 5

It's strange that no one has mentioned Rust yet . Its developers set themselves the task of making the language as simple as possible with a minimum number of entities. The language is actively developing; closures, pattern matching and template types already exist in it.