davdar

3 ms·

1. 1.▲
   Automatic Proofs of Differential Privacy(nist.gov)

   3 points by davdar 5y ago|0 comments
2. 2.▲
   Differentially Private Synthetic Data(nist.gov)

   3 points by davdar 5y ago|0 comments
3. 3.▲
   by davdar 12y ago

   I'm curious, what do you mean they compose better and allow for analysis [better than monads]?
4. 4.▲
   by davdar 12y ago

   That's like saying "your program is more elegant if it has no monads". It's an incorrect statement. The monadic version is perfectly elegant. Even better: it's the right one.
5. 5.▲
   by davdar 12y ago

   In the non-continuous FRP literature[1], i.e. the kind you actually implement, SF a b = [a] -> [b], which is isomorphic to: Fold a -> Fold b, where Fold a = (exists s. (s, s -> (a, s))), which isomorphic to the type the author writ
6. 6.▲
   by davdar 12y ago

   Clojure transducers are exactly signal functions from Haskell FRP literature, for those interested in such a connection.
7. 7.▲
   by davdar 16y ago

   Yes, breadth first traversal of the solution space is very similar in spirit to our approach. I have since completely rewritten the Haskell implementation. You should really check it out, especially if you are thinking about writing one of
8. 8.▲
   by davdar 16y ago

   Here is my latest Haskell implementation that Matt is referring to (git repo): http://david.darais.com/git/research/der-parser-3/
9. 9.▲
   by davdar 16y ago

   I have since rewritten the Haskell implementation to compute fixed points on cyclic graphs without using pointers or Monads. Check it out if it interests you (git repo): http://david.darais.com/git/research/der-parser-3/
10. 10.▲
    by davdar 16y ago

    Here is the git repo (over http) for my Haskell implementation which exploits the technique to be linear for LL(k) (the Zip module is where this technique is implemented). The constant overhead for the implementation is still extremely hig