You are viewing a single thread.
View all comments View context
2 points

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.

permalink
report
parent
reply
1 point

Thank you. That is a good example.

permalink
report
parent
reply

RetroGaming

!retrogaming@lemmy.world

Create post

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.

Community stats

  • 3.4K

    Monthly active users

  • 1.1K

    Posts

  • 8.8K

    Comments