[Home]Turing programming language

HomePage | Recent Changes | Preferences

Difference (from prior minor revision) (major diff)

Changed: 1c1
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.
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 Macintosh are available.

Changed: 5c5
function factorial(n:int):int
function factorial(n:int):int

Changed: 7c7
result = 1
result = 1

Changed: 9c9
result = n * factorial(n-1)
result = n * factorial(n-1)

Changed: 11c11
end factorial
end factorial

Changed: 13c13
put factorial(10)
put factorial(10)

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 Macintosh 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.


HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited November 10, 2001 9:18 am by 216.6.47.xxx (diff)
Search: