'begin'
	'comment'
		run the high recursive `Ackermann' function.
	
		make sure to have enough runtime stack (30 - 40 kb)
		for the interpreter.

		huh - i love this function...
	;

	'integer' 'procedure' ack (m, n);
	'value' m, n;
	'integer' m, n;
		'if' m = 0 'then'
			ack := n + 1
		'else' 'if' n = 0 'then'
			ack := ack (m - 1, 1)
		'else'
			ack := ack (m - 1, ack (m, n - 1));
	

	'integer' n;

	'for' n := 0 'step' 1 'until' 2 'do'
	'begin'
		outstring (1, `ack ( 3 ,');
		outinteger (1, n);
		outstring (1, `)  := ');
		outinteger (1, ack (3, n));
		outstring (1, `\n')
	'end';
'end'