Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

Lambda Prolog

You are here: irt.org | FOLDOC | Lambda Prolog

<language> An extension of standard Prolog defined by Dale A. Miller and Gopalan Nadathur in 1986, 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 compiles Lambda Prolog for the MALI abstract memory system.

Teyjus (http://teyjus.cs.umn.edu/) is an implementation of Lambda Prolog.

Lambda Prolog home (http://cse.psu.edu/~dale/lProlog/).

Mailing list: lprolog@cs.umn.edu.

["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].


Nearby terms: lambda expression « lambda lifting « LambdaMOO « Lambda Prolog » lamer » LAMINA » lamp-post error

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb