On Fri, May 21, 2010 at 11:53 AM, Chris Cannam <cannam@all-day-breakfast.com> wrote:
> I don't understand.  What answers the question?
>
> Actually I'm not sure I understand the question either -- do you mean
> to ask why the block diagram algebra (which I guess was something from
> the presentation?) is being talked about when the lambda calculus
> already existed?

Yes. And what motivated Faust when other approaches offering similar ideas existed. Because, for example, a lot of the work on macros revisits issues solved in common lisp's macro system.  

Continuing from #lac2010:
..............
(08:31:53 AM) npm: sounds like the common lisp macro system: http://en.wikipedia.org/wiki/Common_Lisp#Variable_capture_and_shadowing
(08:34:41 AM) sampo_v2: sure. this is term rewriting for faust
(08:37:30 AM) npm: but the ideas are the same -- the only diff is where the parantheses are
(08:41:39 AM) npm: clapclapclap
(08:47:05 AM) torbenh4: and that faust is by some magnitude faster than almost anything else.
(08:47:18 AM) torbenh4: except C++ :>
.............

At the same time, who can argue with working C/C++ code. For example, I use your code all the time. Chris, and I'm very thankful it's in pure C/C++  (and it's very awesome and fast... results so far... using a combination of vamp-plugins, groovy&apache-velocity&javascript&flash via xwiki java-based platform http://nielsmayer.com/ts-episode-timeline.png   http://nielsmayer.com/ts-episode-evnt-anls.png   ).

.... 
N.b: Seen in http://frinika.appspot.com/ readme:
If you get problems with glitches then try turning on incremental garbage collection.
java -Xmx256m -Xincgc -jar frinika.jar 

I have found with my dual processor machine this helps. 
java -jar -Xmx512m -XX:+UseParNewGC frinika.jar
(please report if you find this helps).
For jack using java 1.6 you need to add -Xss20m to increase the stack size for the native thread.  
...

-- Niels
http://nielsmayer.com