Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Now, unification is Turing-complete pattern matching

No. First-order syntactic unification is not Turing complete. The combination of unification and resolution is Turing complete.

> For instance, in Prolog, you can unify a variable with an entire Prolog program and call the program at runtime, etc.

Lots of languages allow you to do this. Lisp had "eval" ten years before Prolog existed. Unification is not necessary for this.

Prolog is great, unification is great. Some other things are great too.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: