Viewing profile — def-lkb

https://sourceforge.net/projects/libre/ dates back to 2001. (One could object it is not imperative enough, whatever that means :))

Compression, synchronization and backup systems often use rolling hash to implement "content-defined chunking", an effective form of deduplication. In optimized implementations, Ra…

> I would love to hear of other low(er) barrier-to-entry ways to use LaTeX, because it’s a pretty steep commitment for someone who isn’t a professional writer. I have been working …

I think what you suggest is possible, derivation might even be well suited for this application, however I can't tell if it would be better than existing approaches. There are some…

> Does there exist a regex engine I can try that uses derivatives and supports large Unicode classes and purports to be usable for others? :-) I don't know any besides ocaml-re tha…

I don't think you should be worried about Unicode in particular. Although the derivation formula on paper is parameterized by a character, you don't have to compute the derivative …

Of course, this is nitpicking :). For all practical purpose, this O(log n) is O(1). If you are interested, I can try to recover the proof that the rotation step can be done in O(n)…

Correction, technically, it uses O(log n) space for the recursion, so it is not stricly-speaking inplace, which would mean O(1) space.

I wrote a similar sorting algorithm around 14 years ago (fast, inplace, adaptive merge sort algorithm using rotation/swap, and I think, stable). This is all I remember from the tim…

> having the circle not reset after every color change is probably not feasible unless the module order is fairly convoluted right? Not necessarily no. The thing is that you could …

Both the synchronous and asynchronous frontends preserve as much state as possible (all untouched modules are kept). They differ in the control flow they permit (the asynchronous o…

I am the author of Hotcaml. There is actually some notion of persisting state in it. Reloading is done at the granularity of a module. The reverse dependencies of a module that cha…

The output is a bit underwhelming. You might be interested in https://codinuum.github.io/gallery-cca/ It is not based on tree sitter , the parsers they use are quite impressive. Ye…

Indeed. GADTs provide type equalities and existentials. This example involves neither, only sub-typing (which is quite strong and interesting in Typescript)

That might seem counter-intuitive, but tracing GC is the fastest way to manage memory in general (arbitrary life time, graph shapes and allocation patterns). It permits really fast…

> spaces whose distance measures obey the triangle inequality That would be a metric space, and a distance obey the triangle inequality by definition. The element of the space are …

data Ty a where Int :: Ty Int Bool :: Ty Bool ...

Hi, I did a part of the incremental parsing in Menhir and the whole recovery aspect. I can try to explain a bit. My goal was Merlin ( https://github.com/ocaml/merlin/ ), not resear…

Do you mean making Merlin works in a Js_of_ocaml environment? I am not familiar with JS programming model, but I think it should be possible to turn Merlin into a worker and have s…

You are comparing apples to oranges. The purpose of google algorithm is that, when changing the number of bins, a minimum number of items get moved. This version of your codes prin…

The purpose of reals is just to map from [0-1) to [0-n) where n is the number of hosts. Floating points are used to ease the presentation, I think the algorithm can be ported to in…