A Turing complete language in TypeScript types
2 points
3 hours ago
| 1 comment
| github.com
| HN
aberrantflux
3 hours ago
[-]
KaiScript computes your function at compile time and at runtime, so that any arbitrary function's return will always be typed correctly given that the inputs are known. It supports branching, recursion, arithmetic operations, map(), and other useful builtins. It fully simulates your stack, so closures work as expected.

The language is implemented with a parallel type level and runtime lexer, parser, and eval that mirror each other.

reply