From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 079FFBBBB for ; Fri, 31 Mar 2006 15:24:48 +0200 (CEST) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k2VDOl5W028882 for ; Fri, 31 Mar 2006 15:24:47 +0200 Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id PAA23892 for ; Fri, 31 Mar 2006 15:24:47 +0200 (MET DST) Received: from triton.rz.uni-saarland.de (triton.rz.uni-saarland.de [134.96.7.25]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id k2VDOkta009583 for ; Fri, 31 Mar 2006 15:24:46 +0200 Received: from uni-sb.de (uni-sb.de [134.96.7.230]) by triton.rz.uni-saarland.de (8.12.11.20060308/8.12.10) with ESMTP id k2VDOjm112410819 for ; Fri, 31 Mar 2006 15:24:45 +0200 (CEST) Received: from mail.cs.uni-sb.de (mail.cs.uni-sb.de [134.96.254.200]) by uni-sb.de (8.13.6/2006032300) with ESMTP id k2VDOjET007027 for ; Fri, 31 Mar 2006 15:24:45 +0200 (CEST) Received: from mail.st.cs.uni-sb.de (goscinny.cs.uni-sb.de [134.96.235.32]) by mail.cs.uni-sb.de (8.13.6/2006032300) with ESMTP id k2VDOiBK026416 for ; Fri, 31 Mar 2006 15:24:45 +0200 (CEST) Received: from [134.96.235.101] (jonagold.cs.uni-sb.de [134.96.235.101]) by mail.st.cs.uni-sb.de (Postfix) with ESMTP id DD6421BD87 for ; Fri, 31 Mar 2006 15:24:44 +0200 (CEST) Mime-Version: 1.0 (Apple Message framework v623) In-Reply-To: <28871572.1143807766574.JavaMail.www@wwinf1529> References: <28871572.1143807766574.JavaMail.www@wwinf1529> Content-Type: text/plain; charset=US-ASCII; format=flowed Message-Id: Content-Transfer-Encoding: 7bit From: Christian Lindig Subject: Re: [Caml-list] efficient binary relations? Date: Fri, 31 Mar 2006 15:24:42 +0200 To: Caml List X-Mailer: Apple Mail (2.623) X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-1.5.1 (triton.rz.uni-saarland.de [134.96.7.25]); Fri, 31 Mar 2006 15:24:45 +0200 (CEST) X-AntiVirus: checked by AntiVir Milter (version: 1.1.1-9; AVE: 6.34.0.14; VDF: 6.34.0.124; host: AntiVir2) X-Miltered: at nez-perce with ID 442D2D9F.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at concorde with ID 442D2D9E.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; lindig:01 lindig:01 binary:01 integers:01 binary:01 wrote:01 uni-sb:01 uni-sb:01 caml-list:01 caml:02 bits:04 src:94 extension:05 i'd:05 indeed:06 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 On Mar 31, 2006, at 2:22 PM, yoann padioleau wrote: > If you can represent the y by integers, and that the binary relation > have good property, such as the set of y related to a x (the extension > of x in concept analysis ?) often follows each other, then you can > represent sets by list of intervals. Indeed, this is related to Concept Analysis. My old implementation is in C http://www.st.cs.uni-sb.de/~lindig/src/concepts.html and I'd like to have a better structured implementation in Caml. I don't care for the last bits of performance. -- C