LYCOS RETRIEVER 
Prolog: Lambda Prolog
built 656 days ago
An extension to Prolog that contains higher-order programming, polymorphic types, modules, abstract datatypes, and direct support for lambda- terms. The availability of such lambda-terms and higher-order unification, provides lambda Prolog with novel approaches to meta-programming tasks. These extensions are all achieved by using the intuitionistic theory of higher-order hereditary Harrop formulas.
Source:
Teyjus is an efficient implementation of the declarative language Lambda Prolog. The main strength of Lambda Prolog, a language developed by Dale Miller and Gopalan Nadathur, is the support it offers for higher-order abstract syntax, a new and increasingly popular way to view the structure of complex syntactic objects such as types, formulas, proofs and programs. Lambda Prolog provides such support by using lambda terms as data representation devices and by including primitives for probing such terms in logically meaningful ways. The new features present in the language pose several implementation challenges that have been addressed in the work of Nadathur and his colleagues. The Teyjus system is a compiler and abstract machine based realization of Lambda Prolog that incorporates the ideas that have resulted from this research.
Source:
The eLP Common Lisp interpreter was written by Conal Elliott and Frank Pfenning (CMU) in Common Lisp and implements the core of lambda Prolog (higher-order hereditary Harrop formulas). The Prolog/Mali compiler is written in Prolog/Mali, and produces C code. The execution scheme uses Mali (an abstract memory for representing terms with efficient space management). The system was written by Pascal Brisset and Olivier Ridoux of IRISA, Rennes, France. It implements the core of lambda Prolog.
Source:
MORE ABOUT
Lambda Prolog