Version française
Home     About     Download     Resources     Contact us    
Browse thread
Optimizing symbolic processing code
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Peter Ilberg <peter.ilberg@g...>
Subject: Re: [Caml-list] Optimizing symbolic processing code
On Friday 16 January 2009 08:42:52 Hugo Ferreira wrote:

> I have implemented a simple Prolog like inference engine
> to be used in machine learning algorithms (ILP). My first
> basic test shows that inference is dismally slow (compared
> to a Prolog compiler).

> Consequently I am looking for information on optimizing the code.

For implementing a Prolog-like language, you might want to look at
this book on the Warren Abstract Machine:

http://web.archive.org/web/20030213072337/http://www.vanx.org/archive/wam/wam.html

You might also want to look at 'KANREN' and specifically 'miniKANREN':

http://kanren.sourceforge.net/

miniKANREN is a simple declarative logic programming system embedded
into Scheme. I don't know how efficient the system is, but it might
give you further ideas on how to implement such a system.

--- Peter