Crazazy [hey hi! :D]

  • 4 Posts
  • 90 Comments
Joined 3 years ago
cake
Cake day: June 19th, 2023

help-circle
  • Depends very much on the language you’re using. Haskell and ocaml do fall into that category, whereas erlang and scheme are also functional languages with fairly weak typing.

    If there is one thing that connects functional programming as a whole, it is that in FP, program flow is managed mostly through function application, instead of if statements and for/while loops.














  • Oh yeah was a bit sleepy and thought you could just put arbitrary expressions in the numerator instead of just the type.

    But consider this: heterogeneous propositional equality type of types x and b under equivalence relation a, which is bound somewhere else in the aether that we can’t see in the screenshot

    Constructors of this equality type? No fucking clue but I’m sure there exist some to make the need for an equivalence relation make sense