Sam Lindley
@reifyreflect.bsky.social
They did after I nagged them
June 18, 2025 at 11:40 PM
They did after I nagged them
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
dependent-haskell/Free/FreeApplicative.hs at master · slindley/dependent-haskell
Contribute to slindley/dependent-haskell development by creating an account on GitHub.
github.com
January 26, 2025 at 12:27 AM
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
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/...
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...
dl.acm.org
January 23, 2025 at 5:55 AM
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/...