From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id 14DDFBBA7 for ; Sun, 5 Feb 2006 19:20:15 +0100 (CET) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id k15IKEie016065 for ; Sun, 5 Feb 2006 19:20:14 +0100 Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id TAA15605 for ; Sun, 5 Feb 2006 19:20:14 +0100 (MET) Received: from einhorn.in-berlin.de (einhorn.in-berlin.de [192.109.42.8]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k15IKDa5015858 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=FAIL) for ; Sun, 5 Feb 2006 19:20:13 +0100 X-Envelope-From: oliver@first.in-berlin.de X-Envelope-To: Received: from first.in-berlin.de (e178049075.adsl.alicedsl.de [85.178.49.75]) (authenticated bits=0) by einhorn.in-berlin.de (8.12.10/8.12.10/Debian-4) with ESMTP id k15IKCI0008127 for ; Sun, 5 Feb 2006 19:20:12 +0100 Received: by first.in-berlin.de (Postfix, from userid 501) id 43B25210301; Sun, 5 Feb 2006 19:19:30 +0100 (CET) Date: Sun, 5 Feb 2006 19:19:29 +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: <20060205181929.GA2159@first.in-berlin.de> References: <20060204211943.GA590@first.in-berlin.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20060204211943.GA590@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 concorde with ID 43E641DE.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 43E641DD.000 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 non-trivial:01 foerster:01 ocaml:01 ocaml:01 trivial:01 trivial:01 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 Sat, Feb 04, 2006 at 10:19:43PM +0100, Oliver Bandel wrote: > > Hello, > dito ;-) > > how to implement a simple non-trivial machine (Heinz von Foerster) > in a purely functional manner? > > With functional/recursive OCaml code? > > I had written a mail with attachement (which contains a > jpeg with the structure of the circuit), but it seems it > was blocked or filtered away by the OCaml mailinglist software?! > > So I try to give it as some formulas: > > > let u = func_B x e > let e = func_C u > let y = func_A x > I started with the wrong things in mind, sorry! I have picked the original work (the picture I put on the web was from somwhere else, not the original) from HvF and found the following description: A is an operator/function that works like a trivial machine B is an operator/function that works like a trivial machine c is the internal state! So it should be possible to have only c as a state variable and all other stuff will be derived from the input x and the internal state c via the functions/operators A and B. Sorry for the wrong start, it was too long ago when I looked into the original work! :( So, now the direction is different. But nevertheless thanks for all your efforts on helping with implementing it in OCaml. :) Regards, Oliver