R

rntz

@rntz.net

383 Followers 174 Following

Michael Arntzenius irl. Postdoc at UC Berkeley doing PL + DB + incremental computation. PL design, math, calligraphy, idle musings, &c. rntz.net 🐘 @rntz@recurse.social 🐦 @arntzenius Attempting to use bsky more now that people are showing up.

the same diagram, arranged differently, looking much more visually symmetric
tikzcd diagram generated by q.uiver.app showing a rather tangled collection of nodes, some labeled with letters a,b,c,d,s,t,r, others with either + or x (times).
screenshot of a code editor showing six closing braces/dedents in a row each on separate lines
* 1e3b8d6 work * be68869 work * f78da1b work * 7f85b0b work * f145b04 Update on Overleaf. * 751966e work * 7e34a6c work * 9cbac47 work * a037082 work * ec99d61 work * b292429 work * 908f2fe work * f02ff83 work * 2b7dd67 work * e6d36af work * 570e91a work * c458a82 work * 78966a5 work * dbc0cd6 work * 09f6b18 work * 43e4d6c work * 0ec0ce8 work * bdcdadb rm sections.tex * 9f9e18e add sections.tex * 47f8674 work * aa3b55e work * 7ec0caf work
layer 0
a screenshot of "past puzzles" page from enclose.horse, showing my performance. the exact scores are censored out but days 13-21 are all diamond (perfect); before that is a mix of gold and occasional diamond.
1 Logic programming is (not) functional programming 2 Support, pointedly 3 Why not just...? 4 A finitely supported map from examples to booleans 5 The relevance of being relevant 6 Context hopping 7 Curing maybe-addiction with class 8 What does it all mean?
a numbered heading from a pdf document: 1 Logic Programming is (not) Functional Programming
a handwritten slide, saying: lambda: the ULTIMATE RELATION! -> RELATIONS = FUNCTIONS + SUPPORT -> FINITE support = DATALOG. ENUMERABLE " = PROLOG ?? -> naturally handles: { WEIGHTED logic programming { AGGREGATIONS -> type system is UGLY but I love it <3 GRADED (CO)MONAD + ADJUNCTION + RELEVANT TYPES + HAX
two books lying on top of one another: Driftglass by Samuel R. Delany The Murderbot Diaries, Vol. 1 by Martha Wells
Cryptoconchoidsyphonostomata or WHILE IT'S TO BE HAD.
flamegraph of a Rust program computing the transitive closure of the wiki-Vote.txt SNAP dataset. 80% of its time is spent sorting.
a stack of books: Charles Darwin - On The Origin of Species Philip K Dick - The Man in the High Castle Andy Weir - The Martian Haruki Murakami - Hard-Boiled Wonderland and the End of the World Norman Maclean - A River Runs Through It
We compare the two algorithms on a significant fragment of web layout that includes line breaking, flex-box, intrinsic sizes, and many other features, benchmarking 50 real-world web pages like Twitter, Discord, Github, and Lichess. Across 2216 frames, Spineless Traversal is 1.80× times faster on average. Speedups are concentrated in the most latency-critical frames: on the 65.6% of
cargo run Compiling dijkstralog v0.1.0 (/Users/marntzenius/research/dijkstralog) error[E0277]: the trait bound `!: iter::Seek` is not satisfied --> src/iter.rs:159:62
Rust code, with very careful cross-line alignment of a complex pattern matching block.
instance Ord k => OuterJoin (Position k) where outerJoin l r b p q = case (bound p `compare` bound q, p, q) of (LT, Found k x, _) -> Found k (l x) (GT, _, Found k y) -> Found k (r y) (EQ, Found k x, Found _ y) -> Found k (b x y) _ -> Bound (bound p `min` bound q)
Screenshot of Haskell code. You can find it at https://gist.github.com/rntz/da1f004b2bd2f4268c626c5d6ef8acb4
Haskell code
twitter thread: A: the ideal speculative fiction novel has a political affiliation so confusing no one can tell if they want to cancel it or not B: <image of cover of Too Like the Lightning by Ada Palmer>
View from Mount Diablo summit looking north by north-east. You see hiking trails tracing a path down and then up to Mount Olympia; beyond it there are hills rolling down to Antioch and Pittsburg, and beyond that the Sacaramento River.
GRANITE | | | GRANITE WITH TERMINATION (FREEZING?) ~ NONTERMINATING DATAFUN | | | DATAFUN: finite *sets* ----------------- DATAFUN WITH FINITE DEP TYPES | reflect finite sets as types | use this to enforce termination | FSLANG: finite *maps*
data R = Later R | Now !V data V = Bot V | Pair !V !V | Set ![[V]] | Fun !(V -> R) -- asPair v = v ∨ (⊥ᵥ, ⊥ᵥ) asPair :: V -> (V, V) asPair (Bot v) = (Bot x, Bot y) where ~(x,y) = asPair v -- AN ACTUAL USE FOR A LAZY PATTERN MATCH! asPair (Pair x y) = (x,y) asPair _ = error "non-pair to pair conversion"
looking down on the Bay Bridge towards SF from the top of Yerba Buena Island with the late afternoon sun glaring into the camera
panoramic view looking west down on the Bay Area, taken from Picnic View Ridge in the hills east of Berkeley
# I don't minify because: # # 1. In some posts there are comments which I want "view source" to show, # eg. "Against software development" # # 2. Minifiers don't always preserve layout-relevant whitespace. # This is hard because of CSS, eg. "display: inline" or "white-space: pre". # I use "display: inline" in my nav menu and it hits this case. # # 3. Minifiers don't save that much space taking into account gzip. # I found "Semilattices" got reduced from 7.6k to 6.5k. # But my fonts are already at 60k+! Not worth it. minified = rendered # try: # minified = minify_html.minify(rendered, minify_css=True, minify_js=True) # except SyntaxError as e: # minified = rendered # import traceback # with open('minifier-errors.log', 'a') as f: # print(f'--- FILE: {output_file}', file=f) # traceback.print_exc(file=f)