Sam Lindley

the ICFP 2025 program is coming together! Check out our list of accepted papers: icfp25.sigplan.org/track/icfp-2...

and we'll have three keynotes this year!
icfp25.sigplan.org/track/icfp-2...

⬇️⬇️⬇️

They did after I nagged them

I'm pleased to announce OxCaml!

OxCaml is Jane Street's branch of OCaml. We've given it a new name and a snazzy logo, and done a bunch of work to make it easy for people to try.

dependent-haskell/Free/FreeApplicative.hs at master · slindley/dependent-haskell Contribute to slindley/dependent-haskell development by creating an account on GitHub.

It's a while since I thought about this, but I do remember that there are several ways of phrasing it. Here are a couple that I wrote in GHC over a decade ago: github.com/slindley/dep.... No idea if this code still works in modern GHC

Finite-Choice Logic Programming | Proceedings of the ACM on Programming Languages Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeratio...

Different hats represent different perspectives. Datalog, finite-choice, SAT on the stage. Answer Set Programming (@rg9119.bsky.social) was asking why finite-choice logic programming isn't just answer set programming dl.acm.org/doi/10.1145/...

POPL hats