5 ms·
Especially since they aren't. GHC Haskell, for example, is essentially syntactic sugar for System FC, not λ-calculus.
by lubutu 15y ago
Especially since they aren't. GHC Haskell, for example, is essentially syntactic sugar for System FC, not λ-calculus.
- DanWaterworth 15y agoAnd system FC is... a polymorphically typed λ-calculus.
- TheBoff 15y agoPossibly 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.
- DanWaterworth 15y agoEven 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.
- deleted 15y ago[deleted]