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=0.0 required=5.0 tests=AWL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id 098E2BC6B for ; Sat, 18 Aug 2007 16:57:22 +0200 (CEST) Received: from pih-relay04.plus.net (pih-relay04.plus.net [212.159.14.131]) by concorde.inria.fr (8.13.6/8.13.6) with ESMTP id l7IEvLiH014947 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=NO) for ; Sat, 18 Aug 2007 16:57:21 +0200 Received: from [80.229.56.224] (helo=beast.local) by pih-relay04.plus.net with esmtp (Exim) id 1IMPjt-0006uM-6f for caml-list@yquem.inria.fr; Sat, 18 Aug 2007 15:57:21 +0100 From: Jon Harrop Organization: Flying Frog Consultancy Ltd. To: caml-list@yquem.inria.fr Subject: Re: [Caml-list] List comprehensions Date: Sat, 18 Aug 2007 15:46:11 +0100 User-Agent: KMail/1.9.7 References: <200708181528.18107.jon@ffconsultancy.com> <34D0D539-54E0-4867-AA9F-5327683004E2@gmail.com> In-Reply-To: <34D0D539-54E0-4867-AA9F-5327683004E2@gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Content-Disposition: inline Message-Id: <200708181546.11206.jon@ffconsultancy.com> X-Miltered: at concorde with ID 46C708D1.004 by Joe's j-chkmail (http://j-chkmail . ensmp . fr)! X-Spam: no; 0.00; val:01 ocaml:01 ocaml:01 2007,:98 frog:98 wrote:01 wrote:01 rec:01 caml-list:01 int:01 int:01 variables:02 let:03 hmm:04 variable:06 On Saturday 18 August 2007 15:44:04 Joel wrote: > On Aug 18, 2007, at 3:28 PM, Jon Harrop wrote: > > # [x + 2*x + x/2 | x <- [1; 2; 3; 4]];; > > - : int list = [3; 7; 10; 14] > > How do you do something like this? > > [x + 2*x + y/2 | x <- [1; 2; 3; 4], [y <- [3; 4; 5]];; > > That is a list comprehension with more than one variable where all > variables come from lists. Ooh, look: # let rec sort = function | [] -> [] | x::xs -> sort [y | y <- xs; y=x];; val sort : 'a list -> 'a list = # sort [3;1;6;2;7;4;9;8];; - : int list = [1; 2; 3; 4; 6; 7; 8; 9] Hmm, maybe we could form some sort of rudimentary lathe... -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. OCaml for Scientists http://www.ffconsultancy.com/products/ocaml_for_scientists/?e