Viewing profile — Drup
Drup
HN member- Joined
- Tue, Jul 07, 2015, 9:14 PM UTC
- HN karma
- 897
- Public activity
- 188 items
- HN profile
- View on Hacker News ↗
About Drup
No profile information was provided.
Recent public activity
-
comment
Comment #48212019
Your map was very formative for me when I was exploring metal, thanks a lot ! I would love for this Map to be expanded to modern subgenres. There are lot's of subgenres that comple…
-
comment
Comment #47072374
HM is not complex type inference. In fact, among all the approaches you cite, it leads to the simplest type system and the simplest implementation. Moreover, there are lot's of cou…
-
comment
Comment #47072273
I'm going to be contrarian: Yes, you should learn about type systems if you want to design a programming language, and decide in full conscience what you need. At the very least, i…
-
comment
Comment #42086074
You seem well versed into that corner. Do you have a good (and reasonably complete) introduction/exploration for these memory-efficient data-structure for computation ? I've been w…
-
comment
Comment #41282576
That remark is actually more interesting than you think. As groundbreaking as it was, algorithm W iss far too slow for non-toy languages. All modern HM languages (that I know of) u…
-
comment
Comment #39940723
Actually, there is a rather pervasive notion of "soundness" in programming language theory. It has many flavors (because, as you hint, programming languages are quite varied). One …
-
comment
Comment #37472045
https://regex-generate.github.io/regenerate/ (I'm one of the authors) enumerates all the matching (and non-matching) strings, which incidentally answers the question, but doesn't t…
-
comment
Comment #36599431
Giuseppe Castagna is a very well known PL researcher, and very seasoned when it comes to gradual types and "structural" types (the static version of duck-typing), which seems like …
-
comment
Comment #35056099
Having a good quality and curated regex benchmarks would be quite useful! I hope you plan on having several features, and engines that can only have partial support. That would mak…
-
comment
Comment #35055667
ocaml-re[1] uses a derivative-style construction to lazily build a DFA. The general idea is to use something similar to Owens et al's DFA construction, but doing it inline with som…
-
comment
Comment #31784967
`ocaml-ctypes` currently supports "reverse-bindings" (making OCaml functions available from C) out-of-the-box and mostly takes care of the intersection you are talking about, so th…
-
comment
Comment #29941681
I would encourage you not to use DOIs for software. They are not made for this, and have limitations which are not appropriate. Instead, use Software Heritage https://www.softwareh…
-
comment
Comment #29240391
I'm the author if anyone has questions. :)
-
comment
Comment #27641293
Sigbovik's jokes are of the kind where the premise is completely bonkers. The rest of the development is made with the utmost rigor to highlight said bonkersitude, Reductio ad absu…
-
comment
Comment #27640235
To everyone in this subthread: sigbovik is a conference published every 1st of April. This paper is an April's fool joke. I didn't think people could take that one seriously. I gue…
-
comment
Comment #27393086
My understanding is that the difference between fuzz testing and property testing is how the input is crafted. Both can be viewed as a pair of things: a function to generate series…
-
comment
Comment #27301678
I disagree with the sibling comments: regular expressions should still be about regular languages. It's not because Larry Wall committed yet another atrocity that we should all fol…
-
comment
Comment #27300878
That is very limited in practice. In my experience, it doesn't scale to more complex features.
-
comment
Comment #27300629
Creating strings that match a regex can be very useful for testing too, as it allows you to fuzz a regex engine without using another regex engine as oracle. It is indeed quite sub…
-
comment
Comment #26108191
Hi steve, since you are around: is there a (formal?) description of how this "niche" layout optimization behaves on ADTs in general, or any documented work on the topic?
-
comment
Comment #25083381
Amusingly, I was precisely working today on extra-nice error messages for module type errors in OCaml. :) My reaction to the title was "But they are not exotic, I use them every da…
-
comment
Comment #24000323
In france, and in particular in Paris, https://www.geovelo.fr/ is very very good. It knows about various Parisian specialties (going the wrong way on residential street is allowed,…
-
comment
Comment #23335667
Unfortunately, this is not the case as soon as you add grouping! To properly express regular expression with grouping, finite state automatons are not sufficient and you need the t…
-
comment
Comment #23044915
In french, "la petite reine" (i.e., "the little queen") is a fancy literary idiom for a bicycle. Also, "bicyclette" is a feminine noun.
-
comment
Comment #22951480
There is a really easy solution to this: write regexes with combinators. star (range 'a' 'z') Naturally, it's trivial to have a `posix` combinator (or any other syntax, really), wh…