RetroGaming

19555 readers

183 users here now

Vintage gaming community.

Rules:

Be kind.
No spam or soliciting for money.
No racism or other bigotry allowed.
Obviously nothing illegal.

If you see these please report them.

founded 1 year ago

MODERATORS

[email protected]

1380

How hard could it be? (lemmy.world)

submitted 4 weeks ago by [email protected] to c/[email protected]

176 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 2 points 3 weeks ago (1 children)

Take for example Haskell. It's a functionnal, typed language. In Haskell, at compile time, the compiler analyzes all the types of all your functions and if they all match, it drops them completely. There is no type information at all left in a compiled Haskell program, because the compiler can know ahead of runtime if it is correct.

[–] [email protected] 1 points 3 weeks ago

Thank you. That is a good example.