fp@PROOF.ERGO.CS.CMU.EDU (Frank Pfenning) (10/11/89)
This post announces the formation of a new mailing list <elp@cs.cmu.edu>
for a discussion of topics related to lambda Prolog and the Ergo project's
implementation, eLP. This first complete implementation of lambda Prolog
(primarily by Conal Elliott <conal@kestrel.kestrel.edu> with contributions
by myself and Dale Miller <dale@linc.cis.upenn.edu>) is available free of
charge via anonymous ftp on the Internet from a.ergo.cs.cmu.edu in the
pub/ess subdirectory. Refer to the README file there, or send mail to
<elp-request@cs.cmu.edu> for more information.
The logic programming language lambda Prolog is an experimental language
that was designed to extend Prolog in several directions. These
extensions include the following: a polymorphic type system, higher-order
programming, simply typed lambda-terms as data structures, higher-order
unification, scoping mechanisms for program clauses and parameters, and
modules and data abstraction. On the other hand, many extra-logical (no
flames, please) primitives such as var, univ (=..), assert, or retract are
intentionally not available.
Many aspects of this language have been described in various published
conference proceedings and journals. A good starting point is
"Gopalan Nadathur and Dale Miller: An Overview of lambda Prolog,
Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, MIT Press, August 1988, pages 810-827."
-------------------------------------
Frank Pfenning
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213-3890
Telephone: (412) 268-6343
InterNet: fp@cs.cmu.edu
-------------------------------------