From MAILER-DAEMON Mon Nov 28 21:35:14 2005 Received: from mailman by lists.gnu.org with archive (Exim 4.43) id 1EgvKs-0004D2-AN for mharc-pika-dev@gnu.org; Mon, 28 Nov 2005 21:35:14 -0500 Received: from mailman by lists.gnu.org with tmda-scanned (Exim 4.43) id 1EgvKq-0004Cv-Mx for pika-dev@nongnu.org; Mon, 28 Nov 2005 21:35:12 -0500 Received: from exim by lists.gnu.org with spam-scanned (Exim 4.43) id 1EgvKp-0004Cj-64 for pika-dev@nongnu.org; Mon, 28 Nov 2005 21:35:12 -0500 Received: from [199.232.76.173] (helo=monty-python.gnu.org) by lists.gnu.org with esmtp (Exim 4.43) id 1EgvKo-0004Cg-9i for pika-dev@nongnu.org; Mon, 28 Nov 2005 21:35:10 -0500 Received: from [68.142.198.213] (helo=smtp114.sbc.mail.mud.yahoo.com) by monty-python.gnu.org with smtp (Exim 4.34) id 1EgvKo-0003tw-5x for pika-dev@nongnu.org; Mon, 28 Nov 2005 21:35:10 -0500 Received: (qmail 11284 invoked from network); 29 Nov 2005 02:35:09 -0000 Received: from unknown (HELO ppp-71-138-108-231.dsl.pltn13.pacbell.net) (tom.lord@sbcglobal.net@71.138.108.231 with plain) by smtp114.sbc.mail.mud.yahoo.com with SMTP; 29 Nov 2005 02:35:08 -0000 From: Thomas Lord To: pika-dev@nongnu.org Content-Type: text/plain Date: Mon, 28 Nov 2005 18:27:56 -0800 Message-Id: <1133231276.5982.0.camel@localhost.localdomain> Mime-Version: 1.0 X-Mailer: Evolution 2.0.4 (2.0.4-7) Content-Transfer-Encoding: 7bit Subject: [Pika-dev] this thing X-BeenThere: pika-dev@nongnu.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: pika-dev.nongnu.org List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 29 Nov 2005 02:35:12 -0000 I have been working on a simple, small software system which is, nevertheless, of fairly intricate design. Here is one paragraph and links to a web site about applications and the tech: I am building a tiny graph reduction engine for running functional programs with some unusual properties. Primitive combinators in this system are expected to be very large computational steps (e.g., "parse this string to produce a DOM tree"). Execution is strictly demand driven -- programs are monads whose mutable state consists only of "signal ports" and programs are granted cycles only when output from a given signal port is demanded. The VM has a simple model of clustering (virtual nodes connected via signal ports) and process isolation (rings of protection). Trees (code and data graphs) are immutable, acyclic combinations of tree-nodes, identifiers, and binary blobs. The VM can automatically cache the outcome of any sequence of reductions that does not include I/O. The whole implementation is looking like it will come out far under 10K lines of code. I believe it will have many interesting performance characteristics making it especially useful for writing web services. Applications: http://www.seyza.com/the-party Tech: http://www.seyza.com/the-vm I'm out of money and time ("pencils down") -- applying for telemarketing jobs and that kind of thing. At the same time, I think I've reached a state in this work where it is initially presentable (albeit very far from polished). I'd like to make some money off this thing. Can you help, please? I'll certainly share some the money that is made if you will help to fund completing the work. -t