this post was submitted on 17 Oct 2024
1382 points (98.9% liked)

RetroGaming

19803 readers
77 users here now

Vintage gaming community.

Rules:

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

If you see these please report them.

founded 2 years ago
MODERATORS
Xylinna@lemmy.world
Tenthrow@lemmy.world
gts@lemmy.world
1382
How hard could it be? (lemmy.world)
submitted 2 months ago by The_Picard_Maneuver@lemmy.world to c/retrogaming@lemmy.world
176 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[โ€“] themoonisacheese@sh.itjust.works 2 points 2 months 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.

[โ€“] Saleh@feddit.org 1 points 2 months ago

Thank you. That is a good example.