@cemerick @reiddraper ah ye considered types muh luhd?
-
-
Replying to @bitemyapp
@bitemyapp@cemerick eh? The problem I'm addressing exists in haskell too. (Race condition detection)1 reply 0 retweets 0 likes -
Replying to @reiddraper
@reiddraper@bitemyapp@cemerick true. Theres room to improve it.1 reply 0 retweets 0 likes -
Replying to @cartazio
@cartazio@bitemyapp@cemerick I don't just mean 'data races' either, just semantic race-conditions. I've not seen types that catch that2 replies 0 retweets 0 likes -
Replying to @reiddraper
@reiddraper@cartazio@bitemyapp@cemerick you should check out types for determinism / deterministic execution. E.g. DPJ or LVars1 reply 0 retweets 0 likes -
Replying to @csgordon
@csgordon@cartazio@bitemyapp@cemerick yeah, LVars are very cool, but just going back to the original point, don't subsume tests2 replies 0 retweets 0 likes -
Replying to @reiddraper
@reiddraper@csgordon@cartazio@bitemyapp@cemerick Besides, even with LVish there's no type-level guarantee that a "lattice" is a lattice.3 replies 0 retweets 1 like -
Replying to @lindsey
@lindsey I may have just made a repo because I couldn't resist a bad pun: https://github.com/lenary/ILLVars1 reply 1 retweet 1 like -
Replying to @lindsey
@lindsey I think even@edwinbrady would be proud of that one.1 reply 0 retweets 1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.