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

RetroGaming

19596 readers
398 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 1 year ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[โ€“] themoonisacheese@sh.itjust.works 2 points 1 month 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 1 points 1 month ago

Thank you. That is a good example.