4 ms·
I think it will be better if we figure out how to do embedded catalog in other languages. I.e. I really liked The research here https://github.com/rntz/datafun
by a-saleh 8y ago
I think it will be better if we figure out how to do embedded catalog in other languages. I.e. I really liked The research here https://github.com/rntz/datafun https://github.com/rntz/datafun, where we start with "datalog=relational algebra+fixpoints" and then are trying to figure out how far can we take this in language where not everything is a table of facts :)
- convolvatron 8y agoschelog by Dorai Sitaram https://ds26gte.github.io/schelog/index.html https://ds26gte.github.io/schelog/index.html is a classic version of a funtional/declarative hybrid as a purely operational artifact. apparently its still being updated, but I remember it from many years ago (early 90s?). it uses the ability to return multiple times from a continuation to allow sets of results (streams or solution trees) to be expressed directly in scheme and intermixed freely with the functional subset. a 'nice' mixture of declarative and procedural would be really slick. i should go back and look at mozart/oz again. I'll definately see if my limited ability to deal with formalisms lets me understand the type system proposed in Datafun.
- a-saleh 8y ago"Streams of solution trees" kinda reminds me of mikro-kanren [1]. When I was using Clojure roughly 3 years ago, kanren was quite popular embedded logic. W.r.t. Datafun, i learned about it from a talk its creator gave on strangeloop last year [2], for me it seemed quite approachable :) [1] http://webyrd.net/scheme-2013/papers/HemannMuKanren2013.pdf http://webyrd.net/scheme-2013/papers/HemannMuKanren2013.pdf [2] https://www.youtube.com/watch?v=gC295d3V9gE https://www.youtube.com/watch?v=gC295d3V9gE