3 ms·
How about normally-Turing-complete languages that can be stripped down to non-Turing-completeness to make a configuration DSL? This is exactly what Tcl support
by yellowapple 7y ago
How about normally-Turing-complete languages that can be stripped down to non-Turing-completeness to make a configuration DSL?
This is exactly what Tcl supports / was designed to do (and in turn is one of my motivations for developing OTPCL). This is also exactly what your average Lisp or Scheme supports.