alex_muscar

6 ms·

1.
by alex_muscar 2y ago
This goes at least as far back as anaphoric macros: https://en.m.wikipedia.org/wiki/Anaphoric_macro .
2.
by alex_muscar 2y ago
Just curious who pays for cleaning up the debris after one if these landings.
3.
by alex_muscar 3y ago
The part where he asserts indexing should start at zero is this: > Adhering to convention a) yields, when starting with subscript 1, the subscript range 1 ≤ i < N+1; starting with 0, however, gives the nicer range 0 ≤ i < N. So le
4.
by alex_muscar 3y ago
That is just untrue. Compilers tend to generate better code for imperative algorithms because current architectures implement a fundamentally imperative model. Yes, "sufficiently advanced" compilers can generate code that has simi
5.
by alex_muscar 3y ago
Knuth's original article is a good starting point: http://literateprogramming.com/knuthweb.pdf . Knuth's Programming Pearls entries are good reading as well.
6.
by alex_muscar 3y ago
I was playing around with SPARC assembly and realised that implementing coroutine linkage can turn out quite elegant. It kind of resembles Knuth's MMIX.
7.
by alex_muscar 3y ago
I've had OK experiences with alibris. Based in UK though.
8.
by alex_muscar 4y ago
Someone on the D subreddit pointed that out as well. I didn't know it was available at compile time. I'll update the post. Thanks.
9.
by alex_muscar 4y ago
That's right. The Cobol version has its own beauty because it's built into the language. Also, this is my TIL nugget of the day. Thanks :)
10.
by alex_muscar 4y ago
Where I use D's metaprogramming capabilities to generate a binary search function using Shar's algorithm.
11.
Beautiful Binary Search in D(muscar.eu)
72 points by alex_muscar 4y ago|59 comments
12.
by alex_muscar 4y ago
Glad to hear that. Brian Kernighan said that he was thinking of updating the AWK book on numberphile last year. Looking forward to it as well :)
13.
A simple problem that isn't(muscar.eu)
3 points by alex_muscar 4y ago|0 comments
14.
A verified algorithm for finding the intersection point of two lists(muscar.eu)
3 points by alex_muscar 4y ago|0 comments
15.
Determining the intersection point of two lists in O(1) space(muscar.eu)
3 points by alex_muscar 4y ago|0 comments
16.
by alex_muscar 5y ago
That's a nice project idea. Made me try it in common lisp which comes with a compiler built in. It's fairly doable. The only downside is the big executable sizes for SBCL and CCL, and the relatively slow startup times for ECL.
17.
by alex_muscar 5y ago
I think GNU grep does something similar. When it has a fixed patter it uses Boyer-Moore [1]. [1]: https://lists.freebsd.org/pipermail/freebsd-current/2010-Aug...
18.
by alex_muscar 7y ago
Nice work. I don't think people appreciate just how much work has been put into this project.
19.
by alex_muscar 10y ago
Thank you!
20.
by alex_muscar 10y ago
> Would there be enough interest in having these letters in searchable form to motivate the effort? Yes, please :). Esp. Dijkstra's letter from the 5th of Apr '79. It's a bit hard to read. Thanks for making them available.
21.
by alex_muscar 10y ago
I cannot upvote you enough.
22.
by alex_muscar 10y ago
Yes, that is do-able, if they want to make this change.
23.
by alex_muscar 10y ago
I didn't say constructor arguments don't have tuple semantics :). In OCaml tuples are a "unit", i.e. you can't use (,) as an operator. In that sense they match with the constructor semantics: it needs all its argume
24.
by alex_muscar 10y ago
Nice to see that OCaml is getting so much love at facebook. Unfortunately, adding a new syntax that's almost OCaml, but not quite, doesn't seem like such a great idea. While it might make the language accessible to more people, it
25.
by alex_muscar 11y ago
This is a really neat book. The fact that it builds a complete compiler and virtual machine in ~100 pages is really amazing.
26.
by alex_muscar 11y ago
I wouldn't say it's a language war :) The communities of D, C++ and Rust seem quite civil.
27.
by alex_muscar 11y ago
This looks really interesting. I'll give it a go :)
28.
by alex_muscar 11y ago
Subtyping polymorphism
29.
by alex_muscar 11y ago
Your approach does not support polymorphism.
30.
by alex_muscar 13y ago
Your point about programmers having favourite editors (which I consider valid) contradicts the point you made about an important part of your audience being middle/high schoolers, which I don't think have such strong preferences t

More ›