@lexa.qexat.com
1.2K followers 360 following 6.7K posts
Posts Media Videos Starter Packs
lexa.qexat.com
The article will probably not be out today, I'll try to publish it tomorrow
lexa.qexat.com
고마워ㅝㅝ
Reposted by ★
gneiss.name
Several years ago while working in Madagascar I came across these small floating plants. I sketched them and the Malagasy name was Ramilamina. When I got back home I learned the English name is Azolla and are actually ferns. They fix nitrogen, can double in mass in two days, and caused an ice age.
Close up picture of azolla sketch of azolla, ramilamina in Malagasy. Azolla in Minecraft. Model created by prehistoric fauna mod team.
lexa.qexat.com
okay just applied at tarides gulp
lexa.qexat.com
introduction done. 164 lines of markdown
lexa.qexat.com
many such gay cases
lexa.qexat.com
i love implementing the lambda calculus *twice* just for an article
Reposted by ★
Reposted by ★
maiannerouge.bsky.social
iel-euh, tu m'avais pas dit qu'c'était un'e magicien'ne-euh
lexa.qexat.com
Just joking, I only have some ideas about proof inference / automation that I want to try out.
lexa.qexat.com
This odd data structure, the typed tree, is a tool that will be useful to me later... but I can't tell much for now. (Mostly because I'm not sure how bad my idea actually is)
lexa.qexat.com
This also means I will probably be able to finally finish my implementation of the lambda calculus fully written in continuation-passing style, since I was stuck out of frustration with this very issue.
lexa.qexat.com
I think that I will write tomorrow about binding monads inside continuations, the syntactical frustration we currently have with that in OCaml, and propose a (probably over-engineered) nice-ish working solution that I came up with while working on a function to connect typed lists.
lexa.qexat.com
Something I won't explore, but that I find interesting and worth mentioning, is the usefulness of typed binary trees in the context of subtyping, in which case `equal` has the type 'ty -> 'ty -> bool option (and probably has a better name, e.g. `check_bound`).
lexa.qexat.com
This odd data structure, the typed tree, is a tool that will be useful to me later... but I can't tell much for now. (Mostly because I'm not sure how bad my idea actually is)
lexa.qexat.com
What I call typed lists here are single-child trees where every node has a blank, and a subtree that wishes to attach to it must have a tab that matches

connect : equal:('ty -> 'ty -> bool) -> ('a, 'ty) tree -> ('a, 'ty) tree -> ('a, 'ty) tree option

(i was implementing this function in CPS)
lexa.qexat.com
I think that I will write tomorrow about binding monads inside continuations, the syntactical frustration we currently have with that in OCaml, and propose a (probably over-engineered) nice-ish working solution that I came up with while working on a function to connect typed lists.
lexa.qexat.com
# let xs = [0; 1; 2]
val xs : int list = [0; 1; 2]
# let ( .%[;..] ) a b = a @ Array.to_list b
val ( .%[;..] ) : 'a list -> 'a array -> 'a list =
# let ys = xs.%[3; 4; 5]
val ys : int list = [0; 1; 2; 3; 4; 5]

chat i dont think we should let french ppl design languages ever again
lexa.qexat.com
This recursive type is not regular. All uses need to match the definition for the recursive type to be regular.
lexa.qexat.com
because i wont maintain them anymore
lexa.qexat.com
all my python project repos are now archived 🥲
Reposted by ★
rejectconvenience.com
This is how my projector works (in blender)! (please note the perspective is insane here, the light sources are actually very close together)