Reposted by Mike Samuel 🟣
sometimes you just have to write a compiler that isn't a joke after you wrote a compiler as a joke
Mike Samuel 🟣
@mvsamuel.bsky.social
889 followers 938 following 2.8K posts
Programming languages person focused on software systems problems. Previously, first frontend engineer on Google Calendar, and was a security engineer who worked on the industrial-strength Mad Libs undergirding Gmail. Pro-trans-rights is pro-family.
![[Typescript playground editor pane on the left]
function lieAbout(b: boolean): false {
return b as false
}
export function lieMaxxing(
a: number,
b: number,
): number {
return lieAbout(a > b) ? b : a;
}
[Typescript compiler's plain JavaScript output on the right]
function lieAbout(b) {
return b;
}
export function lieMaxxing(a, b) {
return lieAbout(a > b) ? b : a;
}](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreidcvw2qud73arin2mfy7kd7tvperetmyc2rxws3tz52cf4mebuwha)
![> > Merged main, and now it's just the deletions.
>
> Deletions are my favorite thing.
Now I've got an EDM remix of Rodgers and Hammerstein spliced with a ranty code reviewer yelling "Garbage code!!!", "DELETE IT!!!" stuck in my head.
[transparent-background smiley face emoji picker button]](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreidqk5gzh467mcvejojm3mobvucorw2owgh2rzls5h5dmifj2kvxku)
![[pretty printed Kotlin code with IDE overlays showing that the `this` type for block lambdas is "this: Planting" in all four nested lambdas]
val ifStmt = macroEnv.treeFarm.grow(macroEnv.pos) {
Block {
If(
cond = {
Call {
V(vIsNullFn)
Rn(name)
}
},
thn = { Replant(freeTree(macroEnv.args.valueTree(1))) },
els = { Rn(name) },
)
}
}](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreiek6dqpvhezm55uishftu6u6jf23qzblz4uxhtpxorign7ezcfu7m)
![[All caps old timey pixelated font showing text (below) above a series of bars for various code models]
Mike Samuel
Google software security engineer
>
590 strength · Top 7%
<
Claude Opus 4.8 says
<
3/10
>
Software engineer known for work on web security, code sanitization, and contributions to projects like Caja, Closure Templates, and JavaScript tooling at Google.
[bars]
GPT-5.5 about 80% full
GPT-5.5 mini about 95% full
Claude opus 4.8 about 80% full
Claude Haiku 4.5 about 75% full
Grok 4.20 about 75% full
Gemini 3.1 Lite about 95% full
Kiwi K2 0905 about 25% full
Deepseek v4 about 95% full
Llama 3.3 70B and 3.2 1B empty
GLM 4.7 flash about 95% full
Mistral 3.2 24B about 80% full
Owen3 8B empty](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreihxtagkqmndcxfoxxxgatgjfcyzn7isafpm2vm5mehtre6dpfpkyy)
![[Second to last paragraph is highlighted starting with "Victims of". First sentence of last paragraph is in bold: "Pseudonymity saves lives"]
Pseudonymity, or the use of a nickname or fictitious name online, has always been deeply valued on the internet. It grants people protections and freedoms that are often impossible to benefit from offline.
Women, and especially women who are part of male-dominated online communities, have regularly used pseudonyms to hide their gender online in order to protect themselves from sexual harassment, stalking, and physical violence even.
Transgender and gender-diverse people also regularly use pseudonyms for protection, or use new chosen names to explore their gender identity online.
Victims of domestic violence, victims of stalkers, activists, and even journalists often use pseudonyms to protect themselves from aggressors or oppressive regimes.
Pseudonymity saves lives. And yet, it is constantly under attack.](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreibbt3o6mng742qegnosju6mvoesixev4qyw3qzbv2gr2lwypgigzm)
![# output truncated due to character limits
# complete code: gist.github.com/mikesamuel/cb3de64fbcd5e699dfc85020de62b126
from math import gcd
def rationals():
"""
Enumerates rational numbers as [numerator, denominator] pairs
in simplest form but not in order.
"""
yield [0, 1]
# Now we have enumerated all values that have neither
# a reciprocal nor a distinct negative.
# From now on, we will only enumerate adjacent positive
# negative pairs, so we will not miss a rational but
# yield its negation.
yield [-1, 1]
yield [1, 1]
# Now we have enumerated all values that lack a distinct
# reciprocal so from now on, when we enumerate a value
# we will also enumerate its reciprocal.
# This means we will neither miss a value in (-1, 1)
# but emit one in (-inf, -1) or in (1, inf); nor vice versa.
# The convention here where numerator is signed or zero
# and denominator is in [1, inf] is followed below, so
# there will be no redundant outputs due to signs on the denominator.
denominator = 1
# We have yielded all rationals with denominator up to and including 1
while True:
denominator += 1
# Python has bigint semantics so no risk of overflow
# First time here, denominator is 2, so we're not repeating
# anything above, and we step by one, so we will eventually
# reach here for every denominator in a rational in (0, 1)
for numerator in range(1, denominator):
if gcd(numerator, denominator) == 1:
# (numerator / denominator) is in simplest form
# 4 yields for all combinations of negation/reciprocal
yield [-numerator, denominator]
yield [numerator, denominator]
yield [-denominator, numerator]
yield [denominator, numerator]
# Because of the gcd check above, we will not output redundant ...](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreihup2ijn4lxjm7y5q2rcaj2bm6xuktf7uof5j75af7pr2lwilou2i)
![[screenshot of code with python in grey top left and a copy icon top right]
from math import gcd
from collections.abc import Generator
def rationals() -> Generator[tuple[int, int], None, None]:
"""
Enumerates all rational numbers as (numerator, denominator) tuples
in simplest form. Numerator is signed; denominator is always positive.
Every rational is yielded exactly once, though not in numeric order.
"""
yield (0, 1)
yield (-1, 1)
yield (1, 1)
denominator = 1
while True:
denominator += 1
for numerator in range(1, denominator):
if gcd(numerator, denominator) == 1:
yield (-numerator, denominator)
yield (numerator, denominator)
yield (-denominator, numerator)
yield (denominator, numerator)
if __name__ == "__main__":
from itertools import islice
for n, d in islice(rationals(), 200):
print(f"{n:+d}/{d}")](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreidmzptxanredkgmaxubem3dwt76xkj5ra2tyqjbkenm4ggj3xcume)
![[Screenshot of Title, subtitle, and first line of an article]
Functional patterns & API/implementation independence
Two great tastes that (could) go great together
What if we could combine chocolate and peanut butter? That'd be amazing, right!](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreiaf5smtrkrl6zptvy4akxyjniibgpe6oahizigc7alvj4i35h3gnm)
![Node interactive REPL session.
Welcome to Node.js v25.2.1.
Type ".help" for more information.
> class Pair/*<A, B>*/ {
| /*readonly*/ a/*: A*/;
| /*readonly*/ b/*: B*/;
|
| constructor(a/*: A*/, b/*: B*/) {
| this.a = a;
| this.b = b;
| }
|
| get[0]()/*: A*/ { return this.a; }
| get[1]()/*: B*/ { return this.b; }
|
| [Symbol.iterator]()/*: Iterator<A | B>*/ {
| let { a, b } = this;
| return function* () {
| yield a;
| yield b;
| }();
| }
|
| toJSON()/*: [A, B]*/ {
| return [this.a, this.b];
| }
|
| toString()/*: string*/ {
| return `Pair [${this.a}, ${this.b}]`;
| }
| }
undefined
>
> let p = new Pair('a', 'b');
undefined
> let [a, b] = p;
undefined
> a
'a'
> b
'b'
> p[0]
'a'
>](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:xnx52zdoyuf777kntfughiwa/bafkreihpkwnnar25qyzvg4s7scgi4fglqxrafzof4pkuvmixjmsf6762ke)
