Viewing profile — alex_muscar
alex_muscar
HN member- Joined
- Thu, Feb 11, 2010, 7:35 AM UTC
- HN karma
- 79
- Public activity
- 36 items
- HN profile
- View on Hacker News ↗
About alex_muscar
No profile information was provided.
Recent public activity
-
comment
Comment #42568225
This goes at least as far back as anaphoric macros: https://en.m.wikipedia.org/wiki/Anaphoric_macro .
-
comment
Comment #40607585
Just curious who pays for cleaning up the debris after one if these landings.
-
comment
Comment #36746451
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 "A nicer range." This…
-
comment
Comment #36681287
That is just untrue. Compilers tend to generate better code for imperative algorithms because current architectures implement a fundamentally imperative model. Yes, "sufficiently a…
-
comment
Comment #35985709
Knuth's original article is a good starting point: http://literateprogramming.com/knuthweb.pdf . Knuth's Programming Pearls entries are good reading as well.
-
comment
Comment #35762543
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.
- story
-
comment
Comment #35536668
I've had OK experiences with alibris. Based in UK though.
-
comment
Comment #34850074
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.
-
comment
Comment #34850050
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 :)
-
comment
Comment #34848680
Where I use D's metaprogramming capabilities to generate a binary search function using Shar's algorithm.
- story
-
comment
Comment #34398849
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 :)
- story
- story
- story
-
comment
Comment #30515948
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, …
-
comment
Comment #30205033
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...
-
comment
Comment #21722300
Nice work. I don't think people appreciate just how much work has been put into this project.
-
comment
Comment #11798330
Thank you!
-
comment
Comment #11798008
> 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 …
-
comment
Comment #11777001
I cannot upvote you enough.
-
comment
Comment #11723768
Yes, that is do-able, if they want to make this change.
-
comment
Comment #11722388
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…
-
comment
Comment #11720650
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 mig…