kxyvr

51 ms·

361.
by kxyvr 11y ago
My problem with OPAM is that there's no Windows port, which makes developing OCaml programs on Windows difficult at best. In theory, we can compile all of the dependencies by hand, but in practice, the Oasis build scripts refuse to wo
362.
by kxyvr 11y ago
Is there a reason why you're looking for Levenberg-Marquardt over a trust-region Newton solver? In general, properly preconditioned matrix-free trust-region Newton solvers will give superior performance to Levenberg-Marquardt. Someth
363.
by kxyvr 11y ago
If the NSA commits an act of industrial espionage, who gets access to that information? Ostenscibly, this information would be valuable to American companies, but I don't recall there being any federal registration where I can sign up
364.
by kxyvr 11y ago
It depends on what you're trying to do. For myself, I wanted to OCR scanned documents and I've been moderately successful using ScanTailor to process the images and then Tesseract to OCR the result. Certainly, it's far from
365.
by kxyvr 11y ago
This isn't really a problem with the type system. Basically, the author figured out that the normal equations with Vandermonde matrices ( https://en.wikipedia.org/wiki/Vandermonde_matrix ) are horribly ill-conditio
366.
by kxyvr 12y ago
The lion in the room is that the DOE National Laboratories have a huge amount of code tied up in MPI and they continue to spend millions of dollars both on hardware and software to support this infrastructure. If you look at the top 500 li
367.
by kxyvr 12y ago
Not that you stated to the contrary, but the reality is that the theory and algorithms for convex optimization doesn't really differ that much from the theory of general nonlinear optimization. Basically, we get different guarantees,
368.
by kxyvr 12y ago
Generally, for something like pot, agencies are going to want a year of abstinence before they'll talk to you. Likely, it'll come up in your clearance interviews and you may have to sign a piece of paper stating that you won&#x27
369.
by kxyvr 12y ago
That is an interesting pattern that essentially does what I need and is much easier to macro expand. Nice job on the pattern!
370.
by kxyvr 12y ago
Actually, that makes a lot of sense. Thanks for the insight.
371.
by kxyvr 12y ago
In fact you can, but it becomes a little verbose. Thankfully, much of the verbosity can be eliminated by macros. In any case, here's an example with lenses that shows how to do this: (* Create a basic lens type *) type ('a
372.
by kxyvr 12y ago
What I never understood is why OCaml allows row polymorphism in objects, but not in record types. For example, we can write: let bar x = x#info + 1 and OCaml will give a type: val bar : < info : int; .. > -> int = <f
373.
by kxyvr 12y ago
That's a shame and the first I've heard of the delay. For me and the software that I write, this is a must have feature and I was very much looking forward to its release.
374.
by kxyvr 12y ago
In the past, I've used them to eliminate and optimize branches with simple interpreters. That being said, I've had better luck with using things like Coq to write a certified interpreter and then outputing to OCaml. In any case,
375.
by kxyvr 12y ago
In case someone else is interested in this kind of work, there's an interesting line of research in certified programs that's similar to this. Basically, you specify the semantics of some language in Coq. Then, write a program i
376.
by kxyvr 12y ago
Is there any reason to use Agda over Coq or vice versa?