i all the A langs

Task/Ackermann-function/ALGOL-68/ackermann-function.alg

@@ -0,0 +1,21 @@
+PROC test ackermann = VOID:
+BEGIN
+   PROC ackermann = (INT m, n)INT:
+   BEGIN
+      IF m = 0 THEN
+         n + 1
+      ELIF n = 0 THEN
+         ackermann (m - 1, 1)
+      ELSE
+         ackermann (m - 1, ackermann (m, n - 1))
+      FI
+   END # ackermann #;
+
+   FOR m FROM 0 TO 3 DO
+      FOR n FROM 0 TO 6 DO
+         print(ackermann (m, n))
+      OD;
+      new line(stand out)
+   OD
+END # test ackermann #;
+test ackermann

Task/Ackermann-function/APL/ackermann-function.apl

@@ -0,0 +1,5 @@
+ackermann←{
+     0=1⊃⍵:1+2⊃⍵
+     0=2⊃⍵:∇(¯1+1⊃⍵)1
+     ∇(¯1+1⊃⍵),∇(1⊃⍵),¯1+2⊃⍵
+ }

Task/Ackermann-function/ATS/ackermann-function.ats

@@ -0,0 +1,8 @@
+fun ackermann
+  {m,n:nat} .<m,n>.
+  (m: int m, n: int n): Nat =
+  case+ (m, n) of
+  | (0, _) => n+1
+  | (_, 0) =>> ackermann (m-1, 1)
+  | (_, _) =>> ackermann (m-1, ackermann (m, n-1))
+// end of [ackermann]

Task/Ackermann-function/Argile/ackermann-function.argile

@@ -0,0 +1,10 @@
+use std
+
+for each (val nat n) from 0 to 6
+  for each (val nat m) from 0 to 3
+    print "A("m","n") = "(A m n)
+
+.:A <nat m, nat n>:. -> nat
+  return (n+1)				if m == 0
+  return (A (m - 1) 1)			if n == 0
+  A (m - 1) (A m (n - 1))

Task/Ackermann-function/AutoHotkey/ackermann-function.ahk

@@ -0,0 +1,11 @@
+A(m, n) {
+  If (m > 0) && (n = 0)
+    Return A(m-1,1)
+  Else If (m > 0) && (n > 0)
+    Return A(m-1,A(m, n-1))
+  Else If (m=0)
+    Return n+1
+}
+
+; Example:
+MsgBox, % "A(1,2) = " A(1,2)