Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

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: 2009-01-16 (16:14)
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:

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

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