That's what eg Haskell does, eg when you derive comparisons for sum tyes, they c... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

eru on Dec 7, 2024 | parent | context | favorite | on: Union types ('enum types') would be complicated in...

That's what eg Haskell does, eg when you derive comparisons for sum tyes, they compare by source order.

pjmlp on Dec 7, 2024 [–]

As does Pascal, Modula-2, Ada, among plenty of others.

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