From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: * X-Spam-Status: No, score=1.7 required=5.0 tests=AWL,SPF_SOFTFAIL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by yquem.inria.fr (Postfix) with ESMTP id 0E209BB84 for ; Fri, 16 Jan 2009 17:19:47 +0100 (CET) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AmQBAAhCcEnVhjEYkWdsb2JhbACUBAEBAQEJCwoHEQO6BoVy X-IronPort-AV: E=Sophos;i="4.37,277,1231110000"; d="scan'208";a="21598712" Received: from ihsmtp02voda.lis.interhost.com (HELO ihsmtp02cons.lis.interhost.com) ([213.134.49.24]) by mail3-smtp-sop.national.inria.fr with ESMTP; 16 Jan 2009 17:19:46 +0100 Received: from [192.168.1.64] ([77.54.249.136]) by ihsmtp02cons.lis.interhost.com with Microsoft SMTPSVC(6.0.3790.3959); Fri, 16 Jan 2009 16:17:06 +0000 Message-ID: <4970B398.5010100@inescporto.pt> Date: Fri, 16 Jan 2009 16:19:36 +0000 From: Hugo Ferreira User-Agent: Thunderbird 2.0.0.19 (X11/20090105) MIME-Version: 1.0 To: Peter Ilberg Cc: caml-list@yquem.inria.fr Subject: Re: [Caml-list] Optimizing symbolic processing code References: <4970488C.9080104@inescporto.pt> <200901161341.53632.jon@ffconsultancy.com> <49709693.50201@inescporto.pt> In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-OriginalArrivalTime: 16 Jan 2009 16:17:06.0860 (UTC) FILETIME=[E02E66C0:01C977F5] X-Spam: no; 0.00; inference:01 inference:01 compiler:01 beginner's:01 ocaml:01 bug:01 2009:98 warren:98 sourceforge:01 prolog:01 prolog:01 beginners:01 wrote:01 wrote:01 abstract:01 Peter Ilberg wrote: > 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 > Ok, new of this document. But I think this demands too-much effort. > > 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. > Did not know about this. I'll take a look. Thanks, Hugo F. > --- Peter > > _______________________________________________ > Caml-list mailing list. Subscription management: > http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list > Archives: http://caml.inria.fr > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > Bug reports: http://caml.inria.fr/bin/caml-bugs >