Turing is a
Pascal-like programming language developed in 1982 by Ric Holt and James Cordy, then of
University of Toronto,
Canada. It is a descendant of [Common Euclid]
?. from Turing features a clean syntax and 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 more robust implementation. Turing is available from Holt Software Associates in Toronto. Versions for
Sun,
MS-DOS and Mac
? are available.
A brief example of Turing is the following recursive function to calculate a factorial.
function factorial(n:int):int
if n = 0 then
result = 1
else
result = n * factorial(n-1)
end if
end factorial
put factorial(10)
http://www.holtsoft.com/turing/home.html is the Turing home page.
This article (or an earlier version of it) contains material from FOLDOC, used with permission.