PROLOG

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. ¿Prolog, also written lambda Prolog, is a logic programming language featuring polymorphic typing, modular programming, and higher-order programming. These extensions to Prolog are derived from the higher-order hereditary Harrop formulas used to justify the foundations of ¿Prolog. Higher-order quantification, simply typed ¿-terms, and higher-order unification gives ¿Prolog the basic supports needed to capture higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Programmers in ¿Prolog need not deal with bound variable names: instead various declarative devices are available to deal with binder scopes and their instantiations. Since 1986, ¿Prolog has received numerous implementations.