E.g. Haskell has enough syntactic sugar for some an even simpler version factori... | Hacker News

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

eru on April 30, 2013 | parent | context | favorite | on: Why SICP Matters

E.g. Haskell has enough syntactic sugar for some an even simpler version

    factorial n = product [1..n]

minikomi on May 1, 2013 [–]

Something similar is achievable in scheme, just takes a little work http://repl.it/InA (click run session) :)

eru on May 1, 2013 | [–]

Oh, you don't even need macros for something similar. E.g. Python's range function works just fine.

Consider applying for YC's Fall 2026 batch! Applications are open till July 27.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact