Hacker News new | past | comments | ask | show | jobs | submit login

Of the list above, I'm most surprised that Swift doesn't have a Turing complete type system.



I wanted to answer with "because Swift's type checking is decidable", but that has changed (with SE-0142 and SE-0157) - allowing recursion. So, it is 'at least' undecidable now.

https://forums.swift.org/t/swift-type-checking-is-undecidabl...


Yes, I did see that bit. Incidentally google provides terrible results for 'swift type system turing complete'.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: