codygman

89 ms·

1. 841.▲
   by codygman 12y ago

   http://yi-editor.github.io/2014/09/05/oop/
2. 842.▲
   by codygman 12y ago

   Out of curiosity, what libraries did you need?
3. 843.▲
   by codygman 12y ago

   How do redundant classes and interfaces improve maintainability over time?
4. 844.▲
   by codygman 12y ago

   That date picker inherits from something though right?
5. 845.▲
   by codygman 12y ago

   > like if you want to add a custom widget type Add a custom widget from a gui program itself? So it's a gui program that has a widget builder then? Why not have an abstract data type which lets you encode the properties of both of t
6. 846.▲
   by codygman 12y ago

   "I treat my female coworkers with respect, I politely discuss technical stuff with them if they feel like. I do make sexist jokes if I was able to get to know them sufficiently before, like any healthy male."[0] Wow. Any health ma
7. 847.▲
   by codygman 12y ago

   > (Not crazy stuff like Monads) Read this and tell me that "crazy stuff like Monads" is an accurate statement: http://homepages.inf.ed.ac.uk/wadler/papers/marktoberdorf/ba...
8. 848.▲
   by codygman 12y ago

   A couple years ago at least, I know I had problems with writing type safe json handling code in Go. I believe my particular hang up was a place where I basically needed an enum.
9. 849.▲
   by codygman 12y ago

   I used to grep everything, but now in emacs I have a "go to definition" for every language I could find it for bound to a hotkey.
10. 850.▲
    by codygman 12y ago

    What is concept is the: newtype Name = Name { unwrapName :: String } (unwrapName -> name) I'm not familiar with this, are you pattern matching on a function type?
11. 851.▲
    by codygman 12y ago

    I like how there aren't any code examples or real proof one way or the other in this blog post.
12. 852.▲
    by codygman 12y ago

    I believe the answer to your question lies in what Tel said: https://news.ycombinator.com/item?id=8671889 If you avoid recursion and use explicit state passing and create an API with combinators hiding the state passing plu
13. 853.▲
    by codygman 12y ago

    Nope! I'm happy to say this one is real :)
14. 854.▲
    by codygman 12y ago

    Yep. Looks like they are using ATS these days: http://www.metasepi.org/en/posts/2014-10-19-osc-tokyo.html
15. 855.▲
    by codygman 12y ago

    If said a implements the Num typeclass (can kind of think of it like an interface) then you can perform Num specific operations such as adding/subtracting or averaging.
16. 856.▲
    by codygman 12y ago

    Only >> ;)
17. 857.▲
    by codygman 12y ago

    Thanks for reading that paper by Wadler. In the past I was very intimidated by papers such as this, but I've found they are one of the best ways to learn. If you go back far enough to when Haskell (or any language) was created you&#x27
18. 858.▲
    by codygman 12y ago

    2 Things. 1. I don't think Monadic == Imperative... 2. Can you post the Haskell code?
19. 859.▲
    by codygman 12y ago

    Doesn't Forth compile incredibly fast?
20. 860.▲
    by codygman 12y ago

    I'm guessing you've never used Lisp/Slime?
21. 861.▲
    by codygman 12y ago

    I don't see why people keep calling Go a better C. Most of the C programmers I know use it because they want manual memory management which Go doesn't have.
22. 862.▲
    by codygman 12y ago

    Fortran is fastest for matrix manipulation and other maths stuff IIRC.
23. 863.▲
    by codygman 12y ago

    > Preventing buffer overflows requires runtime checks. Incorrect. "By using theorem proving and strict type checking, the compiler can detect and prove that its implemented functions are not susceptible to bugs such as division by z
24. 864.▲
    by codygman 12y ago

    There's only one thing you need to learn Haskell: 1. Forget everything you know and follow the types. 2. https://github.com/bitemyapp/learnhaskell
25. 865.▲
    by codygman 12y ago

    Random anecdata, my coworker used to do a lot of work with OCaml.
26. 866.▲
    by codygman 12y ago

    https://www.haskell.org/haskellwiki/Haskell_in_industry https://www.fpcomplete.com/business/resources/case-studies/ http://engineering.silk.co/post/31920990633/
27. 867.▲
    by codygman 12y ago

    That's exactly how I work with Haskell.
28. 868.▲
    by codygman 12y ago

    It verifies types, which most unit test suites I've seen with dynamic languages duplicate.
29. 869.▲
    by codygman 12y ago

    I'm pretty sure quickcheck is run when you do "cabal test", though you could make a compiler wrapping script that fails if your quickcheck tests fail.
30. 870.▲
    by codygman 12y ago

    Perhaps mathematical proof + comprehensive test suite (including property/fuzz testing) + (time used without bugs showing up * number of people using it)