LAMBDA-PROLOG

Domain	Definition
Computing	Lambda-Prolog An extension of standard Prolog defined by D.A. Miller, in which terms are strongly typed lambda-terms. Clauses are higher order hereditary Harrop formulas. The main novelties are universal quantification on goals and implication. The Prolog/Mali compiler uses the MALI abstract memory system. (ftp://ftp.irisa.fr/pm/pm.tar.Z) E-mail: . Mailing list: prolog-mali@irisa.fr. ["Higher-order logic programming", Miller D.A. and Nadathur G., 3rd International Conference on Logic Programming, pp 448-462, London 1986]. [Nadathur G. "A Higher-Order Logic as a Basis for Logic Programming", Thesis, University of Pennsylvania, 1987]. (1995-02-21). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: LAMBDA-PROLOG

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-a-b-d-g-l-l-m-o-o-p-r"
	-4 letters: apologal, ballroom, balmoral, lapboard, mopboard, podagral.
	-5 letters: allobar, armload, bollard, gambado, lordoma, mallard, malodor, podagra, pollard, roadmap, rollmop.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.