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

Especially since they aren't. GHC Haskell, for example, is essentially syntactic sugar for System FC, not λ-calculus.


And system FC is... a polymorphically typed λ-calculus.


Possibly we just a have a different idea of what a lambda calculus is: I was thinking of Church's untyped lambda calculus, which is a much weirder beast than System FC.


Even if you restrict lambda calculus to mean untyped lambda calculus, it's common practice to discard the types once type-checking has completed and continue the compilation without them.




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

Search: