ΛProlog is a programming language created in 1986. λ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 the λ-tree syntax approach to higher-order abstract syntax, an approach to representing syntax that maps object-level bindings to programming language bindings. Read more on Wikipedia...
- the ΛProlog wikipedia page
- ΛProlog first appeared in 1986
- See also: prolog
- Have a question about ΛProlog not answered here? Email me and let me know how I can help.
Last updated January 25th, 2020