3 ms·
> Zig's type system can properly express a sum type. Surely any Turing complete PL can express a sum type? I can't imagine a language that can support products
by anon-3988 2y ago
> Zig's type system can properly express a sum type.
Surely any Turing complete PL can express a sum type? I can't imagine a language that can support products but not sums.
- Tainnor 2y agoTuring completeness has nothing to do with static type checking. Dynamically typed PLs can't express any type (except Any) yet are still Turing complete.