| author | Nicole Wren |
|---|---|
| date | 2024-11-07 |
| paging | Slide %d / %d |
presented using slides
kanwren
/ dependent_typescript.ts
Last active
May 9, 2026 22:02
Hacking in HKTs and dependent constructions like GADTs, Leibniz equality, and singletons into TypeScript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function id<A>(x: A): A { | |
| return x; | |
| } | |
| function unreachable(x: never): never { | |
| return x; | |
| } | |
| function unused(_: unknown) {} |
kanwren
/ selector.jq
Last active
May 14, 2025 20:33
Parse a Kubernetes-style selector into a consumable tree in jq
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def o(P):P//.; | |
| def k(P):o(P|k(P)); | |
| def w(P;f):(.r=[]|P) as $r|.s=$r.s|.r+=[$r.r|f]; | |
| def s($r):(.s|match("^(?:"+$r+")")) as $m|.s|=.[$m.length:]|.m=$m.string; | |
| def _:s(" *"); | |
| def r($r;f):s($r)|.r+=[.m|f]; | |
| def l($s):select(.s|startswith($s))|.s|=.[$s|length:]|_; | |
| "[a-zA-Z](?:[a-zA-Z0-9-]*[a-zA-Z0-9])?" as $d| | |
| "(?:[a-zA-Z0-9](?:[a-zA-Z0-9_.-]{0,61}[a-zA-Z0-9])?)" as $l| | |
| def K:r("(?:\($d)(?:\\.\($d))*/)?"+$l;.)|_; |
kanwren
/ property-testing.md
Last active
November 7, 2024 21:14
kanwren
/ keybase.md
Last active
February 7, 2025 21:04
I hereby claim:
- I am kanwren on github.
- I am kanwren (https://keybase.io/kanwren) on keybase.
- I have a public key ASCvjJQR1c6UZSHjGAV2yHitMtvUUE0xcTt_ZIwD26vAlwo
To claim this, I am signing this object:
kanwren
/ numbers_from_ops.py
Last active
January 6, 2024 00:51
Find all the ways that you can combine a range of numbers with addition and multiplication
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/usr/bin/env nix-shell | |
| #!nix-shell -i python3 -p python3 | |
| import sys | |
| def compute(nums): | |
| def go(remaining_nums_stack, ops, size): | |
| if len(remaining_nums_stack) == 0 and size == 1: | |
| print(f'{eval_ops_stack(ops)} = {postfix_to_infix(ops)}') | |
| return |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "bytes" | |
| "fmt" | |
| "regexp" | |
| "strconv" | |
| "strings" | |
| "sync" | |
| "unicode/utf8" |
kanwren
/ bitwise_test.go
Last active
July 5, 2023 14:15
Some interesting properties about bitwise arithmetic I found
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package bitwise_test | |
| import ( | |
| "fmt" | |
| "testing" | |
| "testing/quick" | |
| ) | |
| // First, note some simple properties: | |
| // |
kanwren
/ ExistentialExample.java
Last active
February 2, 2023 05:15
An encoding (albeit limited) of existential types in Java through higher-rank polymorphism
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.List; | |
| // some defunctionalization symbols to help us | |
| interface K1 {} // kind Type -> Type | |
| interface K2 {} // kind Type -> Type -> Type | |
| interface A1<F extends K1, A> {} // Apply1 :: (Type -> Type) -> Type -> Type | |
| interface A2<F extends K2, A, B> {} // Apply2 :: (Type -> Type -> Type) -> Type -> Type -> Type | |
| // we encode the existential using two tricks: | |
| // 1. the CPS transform: a ≅ ∀ r. (a -> r) -> r |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "bytes" | |
| "log" | |
| "net" | |
| "os" | |
| "github.com/google/gopacket" | |
| "github.com/google/gopacket/layers" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Quick demonstration of expressing an LL(1) lexers/parsers as lazy iterators in Rust. | |
| // This lets you begin lexing/parsing without reallocating the input, loading the whole of the | |
| // input into memory at once, etc. This does not attempt to address some realistic concerns, such | |
| // as: | |
| // - Incremental parsing; you can't resume a partial parse, which would be annoying if doing | |
| // streaming parsing. For example, if you're writing a Lisp REPL, you might want to allow the | |
| // user to type part of a function call, hit "enter" before they've closed the parentheses, and | |
| // keep typing arguments on separate lines, deferring the execution until they've closed the | |
| // expression. This usually requires something like incremental parsing, which this can't do. | |
| // - Error messages; no location information is retained for good error message reporting! |
NewerOlder