Drup

5 ms·

1.
by Drup 4mo ago
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 completely changed in the last decades (notably, the *cores a
2.
by Drup 7mo ago
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 courses, reference implementations, and reasonable exten
3.
by Drup 7mo ago
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, it will give you a concrete idea of what safety means fo
4.
by Drup 2y ago
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 working on memory representation of algebraic data
5.
by Drup 2y ago
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) use some form of union-find trickeries, as pioneered by the o
6.
by Drup 2y ago
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 of the most simple way of stating it, often dubbed
7.
by Drup 3y ago
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 terminate in the infinite cas
8.
by Drup 3y ago
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 a great fit for Elixir.
9.
by Drup 4y ago
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 make for very interesting comparisons.
10.
by Drup 4y ago
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 some caching, to compile lazily (and building a thomson-li
11.
by Drup 4y ago
`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 this already works quite well. The only gain from em
12.
by Drup 5y ago
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.softwareheritage.org/ , it provides unique identif
13.
by Drup 5y ago
I'm the author if anyone has questions. :)
14.
by Drup 5y ago
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 absurdum.
15.
by Drup 5y ago
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 guess it's a good April's fool then. :)
16.
by Drup 5y ago
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 of bits as input, and a way to turn these bits into the app
17.
by Drup 5y ago
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 follow him off the cliff. Perl can keep its monster. How
18.
by Drup 5y ago
That is very limited in practice. In my experience, it doesn't scale to more complex features.
19.
by Drup 5y ago
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 subtle to be "productive" (that's how we say we
20.
by Drup 6y ago
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?
21.
by Drup 6y ago
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 day!" It's definitely the feature I miss the mo
22.
by Drup 6y ago
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, temporary bike paths, mixed pedestrian&#
23.
by Drup 6y ago
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 theory of transducers which does not admit the same propertie
24.
by Drup 6y ago
In french, "la petite reine" (i.e., "the little queen") is a fancy literary idiom for a bicycle. Also, "bicyclette" is a feminine noun.
25.
by Drup 6y ago
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), which allow you to be compact
26.
by Drup 7y ago
I'm surprised they chose that algorithm, it's fairly limited and not that efficient. If your nodes have width, you should read "Improving Walker's Algorithm to Run in Linear Time" (I have an implementation here: ht
27.
by Drup 7y ago
A self-contained type-system is called "a logic". There are plenty of logics, many of which are not related to set algebra. Furthermore, many type systems are not directly related to set algebra (for instance, Rust's ownershi
28.
by Drup 7y ago
For a little bit of context, Robert Lang is what you could call a "modern master" of Origami. He's one of the author who promoted a "whole vision" approach to model design, using lot's of circle/square pac
29.
by Drup 7y ago
For the type system aspects, there are two steps: 1. Learn the theory. Yes, you need to. On this matter, the book "Types and Programming Languages" (or TAPL for short) is the bible: https://www.cis.upenn.edu/~bcpie
30.
by Drup 7y ago
This is really an apple to oranges comparison. What you linked is not an implementation of the insertion sort. It's a an implementation coupled with proof of correctness . Try to make a mechanize proof of correctness of your python co

More ›