News for hackers. Stuff that matters.
Re:Adventure in Prolog Tutorial (2016) by aargh_aargh on Sunday August 25, 2019 @05:46PM (#20795808)
What are some real-world, non-trivial programs written in Prolog? (with a short description, please)
Re:Adventure in Prolog Tutorial (2016) by carapace on Sunday August 25, 2019 @06:54PM (#20796168)
"Solving symbolic equations with PRESS"

> We describe a program, PRESS, (PRolog Equation Solving System) for solving symbolic, transcendental, non-differential equations in one or more variables. PRESS solves autonomously, i.e. without guidance from the user. The methods used for solving equations are described, together with the service facilities. The principal technique, metal-level inference, appears to be relevant to the broader field of symbolic and algebraic manipulation.

https://www.sciencedirect.com/science/article/pii/S074771718...

https://github.com/maths/press

Re:Adventure in Prolog Tutorial (2016) by LukeEF on Monday August 26, 2019 @06:25AM (#20798614)
We are about to launch an prolog based DBMS. Incredibly powerful engine. Some prolog background here: https://medium.com/terminusdb

Watch this space!

Re:Adventure in Prolog Tutorial (2016) by carapace on Monday August 26, 2019 @12:39PM (#20801264)
I just read your "TerminusDB — what’s in a name?" blog post, love it! The tie-in to Asimov's Foundation, you folks seem pretty serious about that, yes?

- - - -

You're releasing TerminusDB under the GPL! Bless your hearts! I can't wait to see it!

- - - -

Did you know that the Applied Category Theory folks (https://www.appliedcategorytheory.org/) have something they call CQL, Categorical Query Language, https://www.categoricaldata.net/ ? They have a book out that talks about it, "Seven Sketches in Compositionality:An Invitation to Applied Category Theory", specifically Chapter 3 "Databases: Categories, functors, and universal constructions" https://math.mit.edu/~dspivak/teaching/sp18/7Sketches.pdf

Re:Adventure in Prolog Tutorial (2016) by LukeEF on Tuesday August 27, 2019 @06:11AM (#20807917)
Thanks! We're very serious about the link to Asimov's foundation. We're huge fans and our work on the global history databank was, in part, inspired by psychohistory (https://en.wikipedia.org/wiki/Cliodynamics).

-------

Haven't seen CQL - must take a look and share with Terminus team member ('terminator' naturally!) who wrote our query language, WOQL (web object query language). Prolog as the basis for a query language is v powerful. We get: queries returning graphs, recursion as a core feature, composable sub-queries and irregular expressions & cycles.

There is a standardization push in graph query at the moment so I have all this stuff in the front of my mind! Trying to write a 'graph query manifesto' at the moment.

----------

On earlier comment - we are absolutely hiring, especially folks interested in prolog!

Re:Adventure in Prolog Tutorial (2016) by carapace on Wednesday August 28, 2019 @02:38PM (#20822660)
> We're very serious about the link to Asimov's foundation.

Excellent! I've heard that Behavioral Economics is also inspired by psychohistory.

If you're also looking to the future you might want to get in touch with the Long Now Foundation.

In re: CQL the underlying CT treatment of DBs is the "secret sauce". I haven't investigated WOQL in depth yet (I looked at the source in https://github.com/terminusdb/terminusdb) but I agree with you that Prolog is superlative for a query language.

I was joking about hiring, but if you put some issues in github it's not inconceivable you might get a PR someday. I don't want to make any promises.

As I mentioned above, I'm working on Joy-in-Prolog, and I'm right at the point where I'm thinking about how to represent data (as in DBs) using Category Theory along with the standard meta-data in "Data Model Patterns: A Metadata Map" by David C. Hay.

Re:Adventure in Prolog Tutorial (2016) by tempguy9999 on Sunday August 25, 2019 @06:11PM (#20795942)
Re:Adventure in Prolog Tutorial (2016) by noneeeed on Monday August 26, 2019 @04:52AM (#20798302)
The first product I worked on after university was the theorem probing toolkit for the SPARK Ada statically analysable language. This is used to prove the absence of runtime exceptions.

I really enjoy using Prolog, but the number of cases where I would choose to use it is pretty limited.