Turing

For thoughtful child sponsors

Turing is a Pascal-like programming language developed in 1982 by Ric Holt and James Cordy, then of University of Toronto, Canada.

Turing is a descendant of Euclid that features a clean syntax and precise machine-independent semantics. It is used primarily as a teaching language at the high school and university level. Two other versions exist, Object-Oriented Turing and Turing Plus, a systems programming variant. Turing is available from Holt Software Associates in Toronto. Versions for Unix, Microsoft Windows and Apple Macintosh are available.

A brief example of Turing is the following recursive function to calculate a factorial.

 function  factorial (n: int) : int

   assert n >= 0

   if n = 0 then

     result 1

   else

     result n * factorial(n-1)

   end if

 end factorial

 var n: int

 put "Please input an integer :" ..

 get n

 put "The factorial of ", n, " is ", factorial(n)

http://www.holtsoft.com/turing/ is the Turing home page.

This article (or an earlier version of it) contains material from the FOLDOC article on Turing, used with permission.