dissertation-single-spaced
Shin-Barliman
| dissertation-single-spaced | Shin-Barliman | |
|---|---|---|
| 1 | 1 | |
| 58 | 14 | |
| - | - | |
| 0.0 | 0.0 | |
| over 5 years ago | over 3 years ago | |
| TeX | Scheme | |
| - | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
dissertation-single-spaced
-
William Byrd on Logic and Relational Programming, MiniKanren (2014)
> In general, my opinion is that Prolog's approach is pragmatic, but it was designed in the 1970's when hardware was weaker. With modern hardware, there may be different options that better address the need for purity without sacrificing efficiency.
I agree. We are investigating various approaches to improve the efficiency of the search, while retaining completeness, for example.
> Regarding incompleteness, some modern Prologs use SLG-resolution (a.k.a. tabling) to at least avoid the incompleteness resulting by infinite left-recursions. This still allows infinite right recursions but it's easy to get in such a situation with recursion, or even just iteration, in any Turing complete language. I feel that tabling goes a long way towards addressing incompleteness.
I agree that tabling is useful. Tabling is useful even with a complete search, since it can cut off certain cases in which there are infinitely many answers of similar form, and can change the complexity class of queries.
A section of my dissertation discusses adding tabling to miniKanren, based on code Ramana Kumar and I worked on, after discussions and readings with Dan Friedman:
https://github.com/webyrd/dissertation-single-spaced
That tabling implementation is very tricky, though, and doesn't support constraints other than unification. It's time to revisit and update tabling in miniKanren, I think.
> Modern Prolog interpreters generally have an option to enable the occurs check (for example, in Swi-Prolog there's an environment flag to enable it for all unifications) and there's also the ISO predicate unify_with_occurs_check/2, that can be used in meta-interpreters, I guess. I think this addresses the soundness concern.
Shin-Barliman
-
William Byrd on Logic and Relational Programming, MiniKanren (2014)
https://dl.acm.org/doi/10.1145/3358502.3361269
As far as Barliman, we took a step back from imrpoving the interface, and started doing experiments with a bunch of colleagues on various ways to improve synthesis speed and expressiveness.
Until COVID-19 got in the way, Kanae Tsushima and I were beginning to put some of the pieces back together in an improved Barliman, named `新-Barliman` (`Shin-Barliman`, `shin` meaning "new" in Japanese):
https://github.com/k-tsushima/Shin-Barliman
I'm hoping we will make some real progress again soon!
What are some alternatives?
microKanren - The implementation of microKanren, a featherweight relational programming language
mediKanren - Proof-of-concept for reasoning over the SemMedDB knowledge base, using miniKanren + heuristics + indexing.