Lightnews — Scholar-powered news

★ @lexa.qexat.com · 57m

introduction done. 164 lines of markdown

2

★ @lexa.qexat.com · 1h

many such gay cases

1

★ @lexa.qexat.com · 2h

i love implementing the lambda calculus *twice* just for an article

4

★ @lexa.qexat.com · 4h

www.youtube.com/watch?v=jlzg...

Deathpact - SOOTHSAYER (Official Audio)

YouTube video by Deathpact

www.youtube.com

2

Reposted by ★

Lilja Draws Girls @yuurei-lilja.bsky.social · 5h

share your couples' art

13 70

Reposted by ★

maianne @maiannerouge.bsky.social · 10h

iel-euh, tu m'avais pas dit qu'c'était un'e magicien'ne-euh

1 3

Reposted by ★

I suggest selfcest @isuggest.selfce.st · 7h

hey so you can now sponsor me thx <3

Sponsor @NekoDrone on GitHub Sponsors

Support NekoDrone's open source work

github.com

2 2 9

★ @lexa.qexat.com · 12h

Just joking, I only have some ideas about proof inference / automation that I want to try out.

★ @lexa.qexat.com · 12h

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 · 12h

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 · 13h

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.

2

★ @lexa.qexat.com · 12h

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 · 12h

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)

1

★ @lexa.qexat.com · 12h

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)

1

★ @lexa.qexat.com · 13h

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.

1 1 5

★ @lexa.qexat.com · 14h

# 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

2