Editing Prolog (section)

===Related languages===
* The [[Gödel (programming language)|Gödel]] language is a strongly typed implementation of [[concurrent constraint logic programming]]. It is built on [[SICStus Prolog]].
* [[Visual Prolog]], formerly named PDC Prolog and Turbo Prolog, is a [[data type|strongly typed]] [[Object-oriented programming|object-oriented]] dialect of Prolog, which is very different from standard Prolog. As Turbo Prolog, it was marketed by Borland, but is now developed and marketed by the Danish firm Prolog Development Center (PDC) that originally produced it.
* [[Datalog]] is a subset of Prolog. It is limited to relationships that may be stratified and does not allow compound terms. In contrast to Prolog, Datalog is not [[Turing-complete]].
* [[Mercury (programming language)|Mercury]] is an offshoot of Prolog geared toward software engineering in the large with a static, polymorphic type system, as well as a mode and determinism system.
* GraphTalk is a proprietary implementation of Warren's Abstract Machine, with additional object-oriented properties.
* In some ways{{Which|date=February 2010}} Prolog is a subset of [[Planner (programming language)|Planner]]. The ideas in Planner were later further developed in the [[Scientific Community Metaphor]].
* [[AgentSpeak]] is a variant of Prolog for programming agent behavior in [[multi-agent system]]s.
* [[Erlang (programming language)|Erlang]] began life with a Prolog-based implementation and maintains much of Prolog's unification-based syntax.
* [https://picolisp.com/wiki/?accessToLispFunctionFromPilog Pilog] is a declarative language built on top of [[PicoLisp]], that has the semantics of Prolog, but uses the syntax of Lisp.
* [[λProlog]] is an extension of core Prolog that features polymorphic typing, modular programming, and higher-order programming, including direct support for terms with variable-binding operators through so-called λ-tree syntax and higher-order pattern unification.