Semantic Domain
Friday, October 13, 2023
The Ackermann-Péter Function in Gödel's T
›
The Ackermann-Péter function is defined as: A : ℕ × ℕ → ℕ A ( 0 , n) = n + 1 A (m + 1 , 0 ) = A (m, 1 ) A (m + 1 , n + 1 ) =...
Thursday, September 21, 2023
Actually, We Will Read Your Thesis
›
One of the weirder (and wronger) bits of "folk wisdom" surrounding the PhD is that no one reads PhD dissertations. If you look onl...
Friday, July 21, 2023
Linear-time parser combinators
›
My birthday just passed, and to relax I wrote a parser combinator library. Over the last few years, I have worked quite a bit with Ni...
9 comments:
Tuesday, November 15, 2022
CN: Verifying Systems C Code with Separation-Logic Refinement Types
›
We have a new paper on combining separation logic and refinement types to verify C code, appearing at POPL 2023 in a couple of months. It...
Friday, November 4, 2022
Two Papers about Refinement Types
›
The rule of thumb I use is that Noam Zeilberger is generally five to ten years ahead of me in identifying interesting problems. A decade ag...
Tuesday, September 13, 2022
The Golden Age of PL Research
›
I was chatting with a PhD student while back, who remarked to me that many senior PL researchers seemed stuck in a defensive crouch. I thoug...
7 comments:
Thursday, March 17, 2022
Fold Considered Annoying
›
I recently read Shriram Krishamurthi and Kathi Fisler's ICER 2021 paper, Developing Behavioral Concepts of Higher-Order Functions . In t...
7 comments:
›
Home
View web version