There is a blog post by Aphyr doing just that (typing the technical interview), which is well worth a read.
That being said, it is a very small subset of what prolog does, and it has little practical use beyond writing a blog post.
That being said, it is a very small subset of what prolog does, and it has little practical use beyond writing a blog post.
Obviously it doesn't look like Prolog, and you don't necessarily even want the Turing-completeness in your type system -- or at least not to have to rely on it anyway. But I still think the parallels are clear enough that it'd make for a pretty relevant piece of a course in logic programming.