From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id D8A6DBBA7 for ; Mon, 6 Feb 2006 14:11:23 +0100 (CET) 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 k16DBNmQ026685 for ; Mon, 6 Feb 2006 14:11:23 +0100 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 OAA31064 for ; Mon, 6 Feb 2006 14:11:23 +0100 (MET) Received: from einhorn.in-berlin.de (einhorn.in-berlin.de [192.109.42.8]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id k16DBMCM015069 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=FAIL) for ; Mon, 6 Feb 2006 14:11:22 +0100 X-Envelope-From: oliver@first.in-berlin.de X-Envelope-To: Received: from first.in-berlin.de (e178029192.adsl.alicedsl.de [85.178.29.192]) (authenticated bits=0) by einhorn.in-berlin.de (8.12.10/8.12.10/Debian-4) with ESMTP id k16DBLS2014480 for ; Mon, 6 Feb 2006 14:11:21 +0100 Received: by first.in-berlin.de (Postfix, from userid 501) id 2542E2109F4; Mon, 6 Feb 2006 14:10:38 +0100 (CET) Date: Mon, 6 Feb 2006 14:10:38 +0100 From: Oliver Bandel To: caml-list@inria.fr Subject: Re: [Caml-list] From a recursive circuit to a functional/recursive OCaml-code... Message-ID: <20060206131038.GA717@first.in-berlin.de> References: <20060204211943.GA590@first.in-berlin.de> <1139106546.8453.87.camel@rosella> <20060205041600.GA5936@first.in-berlin.de> <1139118167.8453.254.camel@rosella> <20060206115208.GA470@first.in-berlin.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20060206115208.GA470@first.in-berlin.de> User-Agent: Mutt/1.5.6i X-Scanned-By: MIMEDefang_at_IN-Berlin_e.V. on 192.109.42.8 X-Miltered: at nez-perce with ID 43E74AFB.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at concorde with ID 43E74AFA.001 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; oliver:01 bandel:01 oliver:01 in-berlin:01 caml-list:01 recursive:01 recursive:01 ocaml-code:01 bandel:01 recursion:01 clocked:01 binary:01 inverts:01 in-berlin:01 hvf:98 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.1 required=5.0 tests=FORGED_RCVD_HELO autolearn=disabled version=3.0.3 On Mon, Feb 06, 2006 at 12:52:08PM +0100, Oliver Bandel wrote: > On Sun, Feb 05, 2006 at 04:42:47PM +1100, skaller wrote: > > On Sun, 2006-02-05 at 05:16 +0100, Oliver Bandel wrote: > > > > > But I'm not clear about how to write this function "f", > > > because it needs mutual recursion... > > > > No it doesn't, not even with feedback, because your > > system is CLOCKED. > [...] > > I need for this task one clock. > I can do a clock (in binary values) with true and false > or 1 and 0 or so with a variable. > I can do this with loops or functions that inverts their > last value (true -> false and false -> true) with simple > toggling. > I then could use this value and do things depending on the value. Following his paper "Prinzipien der Selbstorganisation im sozialen und betriebswirtschaftlichen Bereich" (Hvf: Wissen und Gewissen, Ffm 1993) (title of the english vesrion: "Principles of Self-Organization in Socio-Managerial Context") I had written this simple inplementation, strictly following his paper: http://me.in-berlin.de/~first/nichttriviale.ml.html Ciao, Oliver