5 ms·
Cute :) Any sufficiently advanced type system is indistinguishable from an interpreter!
by brundolf 3y ago
Cute :)
Any sufficiently advanced type system is indistinguishable from an interpreter!
- klysm 3y ago=> turing completeness
- evolveyourmind 3y agoYou can also easily implement meta-languages. Eg. lambda calculus: https://github.com/desi-ivanov/ts-lambda-calc https://github.com/desi-ivanov/ts-lambda-calc