thesz

160 ms·

1. 1801.▲
   by thesz 16y ago

   >To take a high-profile recent case: this would do nothing to prevent padding oracle attacks. Or future crypto attacks using techniques unknown to us now I don't think it is good argument against preventing known errors. >Your DB co
2. 1802.▲
   Is transactional memory actually easier? (pdf, study on students)(userweb.cs.utexas.edu)

   4 points by thesz 16y ago|0 comments
3. 1803.▲
   by thesz 16y ago

   I should note that stack manipulation gets easier when you assign types for values on stack. Combined with algebraic types from functional languages, it allows one to express very interesting programs in quite Forth way without breaking sec
4. 1804.▲
   by thesz 16y ago

   I think he use combinatoric approach. Yuo can describe a gate using transistors. Then you can describe a circiuit using gates and so on. This is wildly popular in functional programming, and in Haskell in particular. Take a look at those tw
5. 1805.▲
   by thesz 16y ago

   Lenovo used Haskell to glue packages and configuration pipelines with great success. http://cufp.org/archive/2006/slides/CliffordBeshers.pdf They used Haskell's strong static type system to safely glue things together.