If you're using a language with pattern matching (*cough* Haskell *cough*), you ... | Hacker News

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

		LyndsySimon on Aug 7, 2017 \| parent \| context \| favorite \| on: Dijkstra was right – recursion should not be diffi... If you're using a language with pattern matching (cough Haskell cough), you don't even need the conditional...

eru on Aug 7, 2017 [–]

Or rather, the language recognises the conditional and makes sure you handle all the cases.

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