VD>Все можно, только ОКамл в такой среде варился, что вокруг него одни аскеты. Вот рейтрейсер на нем найти элементарно, а сортировку пузырьком ни в жизнь .

(* Interactive loop to read in numbers to be sorted *)
let rec getNumbers l count =
  if count < 25 then
    (print_string "> ";
    match read_line () with
      "" | "0" -> Array.of_list l
    | s -> getNumbers ((int_of_string s)::l) (count + 1))
  else Array.of_list l;;
  
(* bubblesort routine, per the specs *)
let rec bubbleSort arr =
  let swap a b = let temp = arr.(a) in arr.(a) <- arr.(b); arr.(b) <- temp in
  let finished = ref true in
  for i = 1 to Array.length arr - 1 do
    if arr.(i-1) > arr.(i) then 
      (* Swap if needed and set flag to continue for another round. *) 
      (swap (i-1) i; finished := false)
  done;
  if !finished then (* Iterate through the array, printing out its contents *)
    (Array.iter (fun i -> Printf.printf "%d " i) arr; print_newline ())
  else bubbleSort arr;;

let _ = bubbleSort (getNumbers [] 0);;

It has been remarked that computer scientists would rather use each other's toothbrushes than each other's notation.

clean    : ack 3 11  : 0.72 sec  Clean 2.1.1
haskell  : ack 3 11  : 0.88 sec  GHC 6.6
f#       : ack 3 11  : 0.92 sec  F# 1.9.1.8
c        : ack 3 11  : 1.1  sec  Visual C++ 2005
c#       : ack 3 11  : 2.6  sec  Visual C# 2005
scheme   : ack 3 11  : 4.3  sec  DrScheme/MzScheme

module ack
import StdInt

ack :: Int Int -> Int
ack m n | m == 0    = n + 1 
        | n == 0    = ack (m-1) 1
        | otherwise = ack (m-1) (ack m (n-1))

Start = ack 3 11

ack :: Int -> Int -> Int
ack m n | m == 0    = n + 1 
        | n == 0    = ack (m-1) 1
        | otherwise = ack (m-1) (ack m (n-1))

main = print (ack 3 11)

let rec ack (m:int) (n:int) : int =
        if m = 0 then n + 1       else
        if n = 0 then ack (m-1) 1 else
        ack (m-1) (ack m (n-1))

let st = System.DateTime.Now
let h  = ack 3 11
let ft = System.DateTime.Now
let t  = time ft - time st
do  System.Console.WriteLine ("ack 3 11 = {0} & time is {1}\n", h, t)

#include <stdio.h>
#include <conio.h>
#include <Windows.h>

int ack (int m, int n)
{
    if (m == 0) return n + 1;           else
    if (n == 0) return ack (m - 1, 1);  else
    return ack (m - 1, ack (m, n - 1));
}

void main(void)
{
    DWORD st, ft;
    int   m;

    st = GetTickCount();

    m  = ack (3, 11)+1; // Единица здесь прибавляется, а затем убавляется ниже, для того,
                        // что бы шаловливый оптимизатор не заоптимизировал программу слишком сильно 
                        // и не вызвал ack до обоих вызовов GetTickCount (есть такой глюк)

    ft = GetTickCount();
    printf("%d\n\nTime is %ld  msec\n", m-1, (ft-st));
}

using System;
using System.Collections.Generic;
using System.Text;

namespace Ackerman
{
    class Program
    {
        static long Time(DateTime t)
        {
            return (((t.Hour * 60) + t.Minute) * 60 + t.Second) * 1000 + t.Millisecond;
        }

        static int Ack(int m, int n)
        {
            if (m == 0) return n + 1;         else 
            if (n == 0) return Ack(m - 1, 1); else 
            return Ack(m - 1, Ack (m, n - 1));
        }

        static void Main(string[] args)
        {
            DateTime st, ft;

            st = DateTime.Now;

            int a = Ack(3, 11);

            ft = DateTime.Now;
            Console.WriteLine("Ack(3, 11) = {0}  time = {1}", a, Time(ft) - Time(st));
        }
    }
}

(module a mzscheme

  (define (ack m n)
    (cond ((= m 0) (+ n 1))
          ((= n 0) (ack (- m 1) 1))
          (else    (ack (- m 1) (ack m (- n 1))))))

  (define t (current-milliseconds))

  (define a (ack 3 11))

  (printf "(ack 3 11): ~s in ~s~n" a (- (current-milliseconds) t))
)

(require a)

G>        static long Time(DateTime t)
G>        {
G>            return (((t.Hour * 60) + t.Minute) * 60 + t.Second) * 1000 + t.Millisecond;
G>        }
G>        ...
G>            Console.WriteLine("Ack(3, 11) = {0}  time = {1}", a, Time(ft) - Time(st));
G>

using System;
using System.Diagnostics;

class Program
{
    static int Ack(int m, int n)
    {
        if (m == 0)      return n + 1;
        else if (n == 0) return Ack(m - 1, 1);
        else             return Ack(m - 1, Ack(m, n - 1));
    }

    static void Main(string[] args)
    {
        Stopwatch timer = Stopwatch.StartNew();
        int a = Ack(3, 11);
        Console.WriteLine("Ack(3, 11) = {0}  time = {1}", a, timer.Elapsed);
    }
}

Ack(3, 11) = 16381  time = 00:00:00.8839232

using System;
using System.Diagnostics;

static int Ack(int m, int n)
{
    if (m == 0)      return n + 1;
    else if (n == 0) return Ack(m - 1, 1);
    else             return Ack(m - 1, Ack(m, n - 1));
}

Stopwatch timer = Stopwatch.StartNew();
int a = Ack(3, 11);
Console.WriteLine("Ack(3, 11) = {0}  time = {1}", a, timer.Elapsed);

Ack(3, 11) = 16381  time = 00:00:00.4611239

using System;
using System.Diagnostics;

class Program
{
    static int Ack(int m, int n)
    {
        while (m != 0)
        {
            if (n == 0)
                n = 1;
            else
                n = Ack(m, n - 1);
            m--;
        }

        return n + 1;
    }

    static void Main(string[] args)
    {
        Stopwatch timer = Stopwatch.StartNew();
        int a = Ack(3, 11);
        Console.WriteLine("Ack(3, 11) = {0}  time = {1}", a, timer.Elapsed);
    }
}

<xsl:for-each select="rowset/row">
    <xsl:value-of select="@id"/>
</xsl:for-each>

<xsl:for-each select="rowset/row">
ДГ>>    <xsl:value-of select="@id"/>
ДГ>></xsl:for-each>

<xsl:template name="for-each">
    <xsl:param name="nodeset"/>
    <xsl:if test="count($nodeset)!=0">
            <xsl:call-template name="for-each-body">
                    <xsl:with-param name="node" select="$nodeset[1]"/>
                </xsl:call-template>
                <xsl:call-template name="for-each">
                    <xsl:with-param name="nodeset" select="$nodeset[1]/next-sibling::node()"/>
                </xsl:call-template>
        </xsl:if/>
</xsl:template>

ДГ>>Присваиваются... Один раз.

<xsl:variable name="test" select="1"/>
<xsl:for-each select="/*/objs/r">
    <xsl:variable name="test" select="2"/>  <-------
    ...
</xsl:for-each>
<xsl:value-of select="$test"/>

C/C++      7        Mercury      1    
Clean      1        ML           9
Dylan      1        Perl         2
Eiffel     1        Python       1
Haskell    6        Scheme       2
Java       6        Smalltalk    2