robsimmons

5 ms·

1.
by robsimmons 2y ago
The presentation (a PDF with the slides and the talk transcript) are now linked from https://typesafety.net/rob/blog/fclp-at-popl
2.
by robsimmons 2y ago
If every program has a finite model, the language cannot be Turing complete. If it is not possible to give every program a finite model, that doesn't imply that language IS Turing complete. However, in practice, a Datalog-family logic
3.
by robsimmons 2y ago
Indeed — answer set programming has been used for this purpose, see https://arxiv.org/pdf/2212.06719 (which was co-authored by Chris Martens, the co-designer of Dusa and the primary author of the Finite-Choice Logic Pr
4.
by robsimmons 2y ago
Good point! "Whenever" is probably even closer to the correct meaning.
5.
by robsimmons 2y ago
All implementations of Answer Set Programming I am aware of are actually Turing complete, as are many practical implementations of the Datalog idea, and so is Dusa — this is a common misconception! From the paper: "often people take “D
6.
by robsimmons 2y ago
Unfortunately, starting from a perspective that logic programming is mostly Prolog is a pretty bad way of getting to understand what Dusa is about. There's nothing wrong with that starting point, it's just... kind of like trying t
7.
by robsimmons 2y ago
Thank you!
8.
by robsimmons 2y ago
Additional shout out to the Recurse Center ( https://www.recurse.com/ ) which was instrumental in giving me the space and environment to start working on Dusa. I did a partially-remote, partially-in-person batch at Recurse in
9.
by robsimmons 2y ago
There is an implicit algorithm, and I'm so happy about this question. The inability to reason about likely performance of one's code is, to me, one of the things that bothers me most about Answer Set Programming, the programming p
10.
by robsimmons 2y ago
The two answers by jonjojojo and khaledh are great, because they are both the correct answers. From a principled point of view, the rule "a :- b, c" helps define what "a" means, and it seems, in practice, most helpful to
11.
by robsimmons 2y ago
...and if you're in the vanishingly small overlap of folks reading this comment and people interesting in attending an academic talk in Denver next Wednesday, the official conference page for the paper is https://popl25.sigp
12.
by robsimmons 2y ago
Oh, hello hacker news! Also potentially interesting to this crowd are the underlying editor, which I split out from the online Dusa editor and called "sketchzone" ( https://github.com/robsimmons/sketchzone ). S
13.
Does anybody know what "API" means? (Sorta no, but it's okay)(typesafety.net)
1 points by robsimmons 2y ago|0 comments