|
|
|
|
|
|
by prologist
1011 days ago
|
|
|
It's just a demonstration of how to encode the transition rules for Conway's game of life as a set of types, aka logical constraints. TypeScript's type system has unification, same as in Prolog, and since Prolog is basically Turing complete so is TypeScript's type system. |
|
|
https://github.com/microsoft/TypeScript/issues/14833