Category:Lambda Prolog: Difference between revisions

m
no edit summary
(Added info about the language.)
mNo edit summary
 
Line 25:
</blockquote>
 
The syntax is similar to [[Prolog]], but it extends Prolog's basis of [https://en.wikipedia.org/wiki/Horn_clause Horn clause logic] to [https://en.wikipedia.org/wiki/Harrop_formula higher-order hereditary Harrop formulas]. Its higher-order nature allows for quantifying over predicates, and it'sits basis in lambda-tree syntax facilitates construction of terms using lambda abstraction. All λProlog predicates require explicit type signatures.
 
λProlog was first developed in 1986. It has had a number implementations, and is still under active development.