In DrRacket mark the section (with shift+arrows) then use tab or shift+tab.

Looks like a real conference - but the first thing you see is a large image of Rick Astley ?!

We do a "Lyrical Code" T-shirt where people submit song lyrics as code in their favorite language and then we pull verses from different languages to make a polyglot t-shirt. Last year at the conference, attendees voted for Never Gonna Give You Up as this year's song.

2023 - Don't Stop Believing

https://github.com/brightball/carolina-code-conf-lyrical-cha...

2024 - Bohemian Rhapsody

https://github.com/brightball/carolina-code-conf-lyrical-cha...

2025 - All Star

https://github.com/brightball/carolina-code-conf-lyrical-cha...

You can see the final version of the shirt here.

https://blog.carolina.codes/i/148154944/youre-an-all-star

We're a little low on PR's this year unfortunately though. I don't know if it's all the AI or something else but we usually have about a dozen entries by now and we've only got 2 for some reason this year.

> I LOATHE the fact that you traverse lists and vectors in completely different ways

In Racket:

    (for ([x xs]) (displayln x))

This works for `xs` being a sequence, which includes lists and vectors.

Making the type explicit generates faster code:

    (for ([x (in-list   xs)]) (displayln x))
    (for ([x (in-vector xs)]) (displayln x))

Yes, this is the kind of thing why I like Racket and Clojure and so much of the Lisperati don't.

The version Microsoft used is discontinued. However, you can just buy a license of the new product.

https://www.wiris.com/en/mathtype/

This is mentioned right in the article itself.

Agree. It got the ball rolling.

Don't you need parens here?

    (local.get 0)
    (local.get 1)

I do, but where does it say so in the spec?

FWIW if you are looking for examples of WebAssembly written in the textual format, take a look at:

https://raw.githubusercontent.com/soegaard/webracket/refs/he...

As a small example, here is a definition of `$car` which extracts the first value from a pair.

    (func $car (type $Prim1) 
               (param $v (ref eq)) 
               (result (ref eq))
      (if (result (ref eq)) 
          (ref.test (ref $Pair) (local.get $v))
          (then (struct.get $Pair $a (ref.cast (ref $Pair) (local.get $v))))
          (else (call $raise-pair-expected (local.get $v))
                (unreachable))))

This was a great article and inspired me to add support for binary files in `peek`.

https://soegaard.github.io/peek/#%28part._binary-files%29

For me the key insight is that similar values should get similar colors. And since Fx and 0x are "similar" the color palette should be cyclic.

Skim

https://andykeep.com/pubs/dissertation.pdf

Also see the this text:

https://www.cs.umd.edu/class/fall2025/cmsc430/Notes.html

Nanopass uses structures internally to represent the programs.

The Nanopass dsl just gives the user a nicer syntax to specify the transformations.

So, a conventional linked representation of a tree (but not a tree of cons cells).

Yes.