| Lambda-Prolog | |
| ? 6/23/92 ? | |
| compiler(->C), linker, libraries, runtime, documentation | |
| Pascal Brisset <brisset@irisa.fr> | |
| ftp://ftp.irisa.fr/pm/* | |
| Lambda-Prolog, a logic programming language defined by Miller, is an extension of Prolog where terms are simply typed $\lambda$terms and clauses are higher order hereditary Harrop formulas. The main novelties are universal quantification on goals and implication. | |
|
Miller D.A. and Nadathur G. "Higher-order logic
programming", 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. | |
| MALI-V06 abstract memory. MALI is available by anonymous ftp from ftp.irisa.fr | |
| unix | |
| prolog-mali-request@irisa.fr | |
| pm@irisa.fr | |
| July 6th, 1992 |
category: logic programming languages summary, or expanded.
Please send updates to free-compilers@idiom.com
The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.
Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved