EsoNatLangs Bring the Complexity of Natural Language into Code The five esolangs discussed in this piece -- Coem, Love Languages, Prāsa, Kip, and Captive -- draw on aspects of natural language usually avoided in code: nuance and ambiguity, complex grammars and mo...

Kip is featured in a post by @dtemkin.bsky.social about natural language inspired esoteric programming languages! esoteric.codes/blog/five-es...

this, but conservatively?

Fermat, 1637

Rocq is Pacman complete!

see Rocqman, a Pacman implementation (with some proofs!) in Rocq, extracted to C++ via Crane: github.com/joom/rocqman

“If formal verification becomes vastly cheaper, then we can afford to verify much more software. […] AI also creates a need to formally verify more software: rather than having humans review AI-generated code, I’d much rather have the AI prove to me that the code it has generated is correct.”

Türkçe programlama dili Kip (Konuk: Cumhur “Joomy” Korkut) YouTube video by hafif programming

Türkçe programlama dili Kip (Konuk: Cumhur “Joomy” Korkut) youtu.be/XNJ3CJyGemY?...

one thing that would be cool, when prominent creators turn out to be terrible people, would be if we didn't have to go through this performative dance of insisting that their work was never good in the first place.

At Harmonic we've just announced $1,000,000 of sponsorship for Principal Investigators and Rising Mathematicians. Significant O($100K) funding for high-impact projects. Early access to next-generation Aristotle models. Please apply! aristotle.harmonic.fun/sponsorships

number guessing game (courtesy of @fka.dev) in Kip's now interactive playground.

see for yourself at kip-dili.github.io

Kip Programming Language by @joomy.bsky.social

The language is based on a natural language: Turkish 🇹🇷.

Not only one-to-one translations of keywords but the whole language is based on the Turkish grammar.

Here is an example of `isodd` function.

GitHub - kip-dili/kip: A programming language based on grammatical cases of Turkish. A programming language based on grammatical cases of Turkish. - kip-dili/kip

fantastic project. i always wanted to explore turkish grammar in programming because it’s so suitable for fluent constructs. glad to see others thinking the same.

thank you both, for your kind words :)

This Friday, the New Jersey Prog Lang & Systems seminar hosted at @princeton.edu will feature our own @bloomberglp.bsky.social researcher Matthew Z. Weaver presenting new research done with @joomy.bsky.social on extracting certified C++ code from @CoqLang. Full program: njpls.org/dec2025.html

Intrinsic vs. extrinsic verification Tracing the origin of the terms

it's interesting bridging colloquial terminology between domains - as a verification gal, I'm very used to intrinsic/extrinsic to classify verification styles, but surprised my co-authors weren't aware of it, so had to look up if I had just made it up lol

joomy.korkutblech.com/posts/2024-1...

“c gets you close to the machine” is the kind of sentence that lands very differently after working in a factory

you’re not supposed to be close to the machine! that’s where the finger munchers are!

i love c++ mcyoung.xyz/2025/07/14/b...

Bloomberg Infrastructure & Security Ph.D. Fellowship | Bloomberg LP Apply now for the Bloomberg Infrastructure & Security Ph.D. Fellowship program. Applications are due by Monday, June 30, 2025 for the 2025-2026 academic year.

excited that my team at Bloomberg is supporting PhD students in certified programming (and other infra/sec topics too!) through a fellowship. 💻🛡️

includes stipend, tuition, and internship. timely for Rocq and proof assistant folks as science funding tightens. please apply by July 18th! 📬

Violating memory safety with Haskell's value restriction
welltypedwit.ch/posts/value-...

there are two lines of research I'd take a look at:
1. bidirectional predicates in the Prolog world (I think someone already mentioned logic programming)
2. bidirectional lenses. maybe too domain-specific, but probably a good start:
www.seas.upenn.edu/~harmony/
dl.acm.org/doi/10.1145/...

PLUM folks should be made honorary New Jerseyans...

hey, I’m going to be the last talk of the upcoming NJPLS! now I really have to prepare a talk… 🎙️ njpls.org/may2025.html

New York Ataturk Chorus Summer Concert flyer. Saturday, May 31, 2025. 2:30pm.

NYC folks, come hear me sing on May 31!

tickets available here: www.eventbrite.com/e/new-york-a...

Intrinsic vs. extrinsic verification Tracing the origin of the terms

I'm writing a paper and I once again found myself explaining intrinsic vs. extrinsic style of verification. I never know what to cite for this, so I decided to dig a bit deeper to find the origin of these terms. please lmk if you find anything else: joomy.korkutblech.com/posts/2024-1...

I see your cinnamon and raise you a cinnamon

A printed and bound copy of my dissertation. My title “Foreign Function Verification Through Metaprogramming”, my name “Joomy Korkut”, and the Princeton logo are gold foil stamped on a black leather cover.

bound copies of my dissertation arrived and they are so pretty ☀️

thank you!

though to be fair, there is a lot of existing work on reasoning about C programs: softwarefoundations.cis.upenn.edu/vc-current/P...

in the paper, we are using one of them (VST) to reason about C foreign functions linked to CertiCoq-compiled Coq programs.

We didn't go the full ITree route in the paper since the tree is parametrized by a stack of event types, which complicates how the execution function has to be written. (can also have a runtime cost so we have to be careful) But I imagine the ITree approach would organize the proof+program better.

The path is less clear for other effectful programs. There is work on proving effectful programs correct:
* github.com/search?q=rep...
* doi.org/10.4230/LIPI...
* doi.org/10.1145/3293...

Expressing the program with an ITree and writing an execution function for it in C is probably the way to go.

Thank you!

I don't foresee a huge challenge for the mutable array example: We have a purely functional model that computes the same result; VST is good at such proofs. We also now have proofs about how the GC deals with mutation.

if I misunderstood and you were asking about dynamic checks for safe FFI, there's some work on that too: www.cs.princeton.edu/~appel/paper...