Algebraic Logic Functional programming language

Algebraic Logic Functional (ALF) <a href="/facts/Programming_language/cWTYbgWa">programming language</a> combines <a href="/facts/Functional_programming/cdxqPEIM">functional</a> and <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a> techniques. Its foundation is <a href="/facts/Horn_clause/3IRKqnp1">Horn clause</a> logic with equality, which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.
ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's <a href="/facts/Operational_semantics/G24LXz6e">operational semantics</a> is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. To reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than <a href="/facts/Prolog/r5h66Qh1">Prolog</a>'s resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a <a href="/facts/Depth-first_search/luxJKVph">depth-first search</a> in the derivation tree.
The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are <a href="/facts/Compiler/WNfCDFJe">compiled</a> into instructions of an <a href="/facts/Abstract_machine/zuC4RKLn">abstract machine</a>, which is based on the <a href="/facts/Warren_Abstract_Machine/BaP9a6tD">Warren Abstract Machine</a> (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in <a href="/facts/C_(programming_language)/Ky2No763">C</a>.
In the <a href="/facts/Carnegie_Mellon_University/XKd7L2KA">Carnegie Mellon University</a> <a href="/facts/Artificial_Intelligence/lJGauQwX">Artificial Intelligence</a> Repository, ALF is included as an AI programming language, more so as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs on <a href="/facts/Unix/0pNL2seI">Unix</a> and is available under a custom <a href="/facts/Proprietary_software/9zcskxYL">proprietary software</a> <a href="/facts/Software_license/7enfIqhL">license</a> that grants the right to use for "evaluation, research and teaching purposes" but not commercial or military use.

Algebraic Logic Functional programming language open-in-new

Algebraic Logic Functional programming language