3 ms·

I tongue-in-cheek tweeted this, but I was semi-serious. Types end up being Turing-complete all the time: https://twitter.com/TitzerBL/status/1567677824105947136

• jrvarela56 4y ago
  There has to be a joke in here somewhere: We add a language on top to help us with our problems in the original language. Would building a DSL in the language give you the same dynamic?
  • eru 4y ago
    Two languages can both be Turing complete, but still be adapted to very different purposes. > Would building a DSL in the language give you the same dynamic? The Lisp people did something like that. I can't find it now, alas.
    • jrvarela56 4y ago
      | Two languages can both be Turing complete Doesn't this just cause the same problems? If language B (the type system) is Turing complete you'll start doing whatever you don't like doing in language A (the host) and end up with similar problems you had in A, but now in B. | but still be adapted to very different purposes. I guess this is what's needed but each should be constrained as to NOT be able to do certain things.
  • ipnon 4y ago
    You want an algebra for the bits and an algebra for the functions.