HN user

drumnerd

9 karma
Posts1
Comments22
View on HN
Identity Types 10 months ago

In type checking, particularly in dependent types, it is not trivial to check that two types are the same. Different notions of equality are useful in this field. A type can contain a function value inside. How to prove that two functions are the same? Is not enough to prove that for all X f X and g X implies f is g.

Type-machine 11 months ago

So a little bit of syntax is verbose, goes on to invent a whole new syntax for it

A monad is not a container! It’s a way of composing functions if they have an effect. You tell how to inject a value in that effect (unit) and how to compose two functions that have that effect and that’s it: programmable semicolons.

Peer review is of utmost importance. Any researcher can make mistakes. I can read papers and apply them, but I need expert opinion to trust the papers. I am not skilled enough in any but my specialties.

I do see papers with outlandish claims and very weak support. This kind of excessively bold statement I see in many papers is a red flag for me.

Those are basic, you can decompile a function and change its bytecode, you can completely revamp the parser using codecs, etc

Hey kiddo… did you ever try something nastier? I’ve got something that will blow your mind and you’ll keep coming back

You don’t know but you are addicted to types

Come to the light - Haskell!

I think about cones all the time when doing machine learning. If I have an object O that can be mapped to A and B I can learn a function from A to B or B to A if I can generate Os. That’s my view of self supervised learning.