Pascal triangle in array programming: from APL to GNU Octave + Mastrave, Octave

Language: Layout:

% Pascal's triangle in Array Programming: from APL to GNU Octave with Mastrave http://mastrave.org

% Inspired by an APL implementation of the Pascal triangle,
% very terse in exploiting the palindrome nature of each
% n-th vector of binomial coefficients
%
% See also: 
%    http://archive.is/SkNBW
%    http://tryapl.org/?a=pascal%u2190%7B%280%2C%u2375%29+%28%u2375%2C0%29%7D%20%u22C4%20pascal%20%5C%205/1&run

% Local loading of the Mastrave modelling library
[status,answ]=unix('mastrave -m'); addpath(answ)

% Symmetric structure of succession for binomial coefficients
%
% In APL: 
%    pascal←{(0,⍵)+(⍵,0)}   
pascal = @(x)[0 x]+[x 0];

% Exploiting just the base syntax of Mastrave mloop: http://mastrave.org/doc/mtv_m/mloop
%    1. pass the initial value x0 as a cell-array (i.e. a list in non-MATLAB languages)
%    2. pass the last element of the cell-array to the function-handle f
%    3. pack the elements of the cell-array with the result of f
%    4. iterate n times
%
%                 4.     3.         2.          1.
L=@(f,n,x0)mloop( n, @(x){ x{:} , f(x{end}) }, {x0} );

% Iterate 5 times, keeping intermediate results, with inital value: 1
%
% In APL: 
%    pascal \ 5/1
L(   pascal, 5, 1 )

[ + ] Show input
Absolute running time: 0.24 sec, cpu time: 0.15 sec, memory peak: 26 Mb, absolute service time: 0,24 sec

Pascal triangle in array programming: from APL to GNU Octave + Mastrav...