Tag: racket

From Bits to Arguments: sub-range-binders

Written by Dominik Pantůček on 2026-01-15

racket

Sometimes it is convenient to use characters of a string to illustrate the underlying low-level meaning of given identifier. One such example can be a definition of ISA opcode where various bit groups of the binary representation can have different meanings.

...

Advaced GitLab Pipelines

Written by Dominik Pantůček on 2025-10-23

CIracketscribblejavascript

Sometimes you need to build multiple interdependent artifacts in your CI/CD pipelines. And sometimes you can setup your workflow in a non-blocking way for many of these. Read on to see what we are using in our GitLab instance.

...
...

Future let++ Bindings

Written by Dominik Pantůček on 2025-07-31

racketscheme

In a previous post we wrote about the challenges of implementing DAG scoping model for bindings in certain Qi forms. Today we are about to witness an attempt to bring similar scoping rules to plain Scheme and we may reason a bit whether it could be useful in practice.

...

Tree Versus DAG Bindings

Written by Dominik Pantůček on 2025-07-17

racket

Qi is an interesting, flow-oriented programming language. It has a very tacit vibe. But still - sometimes it is useful to bind values to named identifiers. And with certain flow forms you end up with strange binding scopes.

...