Path: news.mathworks.com!not-for-mail
From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Recursive anonymous function
Date: Mon, 9 Mar 2009 21:37:01 +0000 (UTC)
Organization: University of Sydney
Lines: 4
Message-ID: <gp425t$b6k$1@fred.mathworks.com>
References: <gp22jh$sif$1@fred.mathworks.com> <49b5873f$0$4206$5a62ac22@per-qv1-newsreader-01.iinet.net.au>
Reply-To: <HIDDEN>
NNTP-Posting-Host: webapp-03-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1236634621 11476 172.30.248.38 (9 Mar 2009 21:37:01 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Mon, 9 Mar 2009 21:37:01 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1308310
Xref: news.mathworks.com comp.soft-sys.matlab:523609


"Brandon" <bnavra.removethis@student.usyd.edu.au.removethis> wrote   
> a lisp-like calculation system using anonymous functions.
> 
Actually, the description lisp-like is not correct. Maybe lambda expression evaluator is a better one