lpage

13 ms·

61.
by lpage 5y ago
* GADTs: generalized algebraic data types. As the name suggests, GADTs broaden the set of type-level constraints that one can encode using ADTs. A canonical example involves using GADTs to strongly type an AST and evaluator function s.t. at
62.
by lpage 5y ago
On the currently in OCaml and ahead of the time front: * GADTs * Row polymorphism with inference * First-class modules * Let binding operators, e.g., let* for monadic binding On the coming soon to OCaml (hopefully) and way ahead front: * Al
63.
by lpage 6y ago
Full details are in the investor release [1] [1] https://investor.okta.com/static-files/83f1811e-2f92-4c08-a1...
64.
Okta to Acquire Auth0 for $6.5B(cnbc.com)
632 points by lpage 6y ago|315 comments
65.
by lpage 6y ago
The SVGs used to generate the icon fonts are Apache 2.0 licensed: https://github.com/google/material-design-icons/tree/master/... .
66.
Ask HN: Best resources for learning about commercial “IDE grade” parsers
18 points by lpage 6y ago|7 comments
67.
Show HN: Aoctools (automate your Advent of Code workflow)(github.com)
4 points by lpage 6y ago|0 comments
68.
Tell HN: [Slack] Issue with Archival of Some Direct Messages
1 points by lpage 6y ago|0 comments
69.
by lpage 6y ago
Auction theory and applied mechanism design are two of the most real-world useful corners of theoretical economics. Multiunit and combinatorial mechanisms are core to ad markets and sponsored search, smart power grids, logistics, commerce,
70.
by lpage 6y ago
Most of this information is somewhere between incomplete and wrong. Accurate timekeeping (on exchange and otherwise) is crucial to latency-sensitive players in finance. I'll get to that after addressing the article. > For example, i
71.
by lpage 6y ago
As GP alluded to, there’s not really a proper ordering. If you’re talking ease-of-reasoning from a formal methods standpoint, linear types (or ordered types for that matter) are “superior” to affine types. By extension, when compiling to ma
72.
by lpage 6y ago
The three most recent HN discussions on CRDTs are all worth perusing. [1] is an excellent tutorial that assumes no initial familiarity with CRDTs or the math that underpins them. It walks you through both the formalisms and the implementati
73.
by lpage 6y ago
Also an industry practitioner, with an auction theory/mechanism design background. I agree with portions of what you said, but: > queues are over sized with liquidity when the tick size is larger, creating more adverse selection for
74.
by lpage 6y ago
This pencil and paper approach to breaking up work is good at parallelizing things that don't appear parallelizable at first glance, e.g. prefix sum [1]. Compilers are good at identifying opportunities to reorder instructions in ways t
75.
by lpage 6y ago
It's fantastic that Cloudflare is offering this. You might want to reconsider calling it CNI, or at least clarify that CNI is just an umbrella term for PNI and/or public peering. I'm the person that handles the PNI/IX st
76.
by lpage 6y ago
Ed Thorp's "Beat the Dealer: A Winning Strategy for the Game of Twenty-One" is one of the best books ever written about quant trading...despite not being about quant trading.
77.
by lpage 6y ago
That was true until 4.08. OCaml now supports monadic let bindings, and more generally, user defined let bindings [1]. You get the benefits of ppx_let (Jane Street) but in a more general and syntactically nicer form. I still wouldn’t call it
78.
by lpage 6y ago
> The problem with learning about hooks is that they're not generally applicable knowledge about computing or programming. That's true of the hooks API specifically, but not true of the underlying abstraction. Hooks are (inform
79.
by lpage 7y ago
Congrats on the awesome project. In case you haven’t come across it ACAT [1] might be of interest, especially if word rate becomes a limiting factor in communication for you dad, or if he’s interested in using a computer. ACAT is highly fle
80.
by lpage 7y ago
Pros of asm goto: it's useful for introducing low overhead tracing and debugging abstractions. Tracepoints in the Linux kernel are one example [1]. It's also used for implementing certain Meltdown/Spectre mitigations [2]. Con
81.
by lpage 7y ago
> "Support for asm goto, enabling for example the mainline Linux kernel for x86_64 to build with Clang" This is big. Support for asm goto was merged into the mainline earlier this year, but now it's released [1]. Aside fro
82.
by lpage 7y ago
Incidentally, the execution model and abstract machine for OCaml (more accurately Caml Light) is based on Xavier Leroy's paper "The ZINC experiment: an economical implementation of the ML language" [1] - an all time CS classi
83.
by lpage 7y ago
Previous discussion of the same article [1] Discussion of another good article on the Therac-25 (with pictures of the machine) [2] [1] https://news.ycombinator.com/item?id=7992548 [2] https://news.ycombinator.com
84.
by lpage 7y ago
Haskell and ML languages look like symbol soup when you're used to mainstream/C style languages. Once you understand some of the basic syntax they become quite readable and easy to reason about as a series of transformations. Step
85.
by lpage 8y ago
Like Dropbox? I’ll just leave this here: [1]. The details are seldom easy. [1]: https://news.ycombinator.com/item?id=9224
86.
by lpage 8y ago
Related: the Farey sequence [1]. Well worth investigating if you found this paper interesting. [1] https://en.wikipedia.org/wiki/Farey_sequence
87.
by lpage 8y ago
Oblivious transfer [1], especially as it pertains to secure multi-party computation (MPC). It's not as easily visualized as Diffie–Hellman or Shamir's Secret Sharing (both of which have already been mentioned), but a good chunk of
88.
by lpage 8y ago
Their original white paper [1] is one of my favorite math-meets-software reads. Readable, elegant, and real world. https://www.ee.columbia.edu/~dpwe/papers/Wang03-shazam.pdf
89.
by lpage 8y ago
For anyone else interested: https://git.kernel.org/pub/scm/git/git.git/commit/?id=7913f5...
90.
by lpage 8y ago
As a self contained, foundational course, Georgia Tech's OMSCS offering [1] is solid. Charles Isbell and Michael Littman are great at building intuition into equations. [1] https://www.udacity.com/course/reinforcem

More ›