T
1. True. A Lisp compiler by Johnathan A. Rees in 1982 at Yale University. T has
static scope and is a near-superset of Scheme. Unix source is available. T is
written in itself and compiles to efficient native code. Used as the basis for
the Yale Haskell system. Maintained by David Kranz
<kranz@masala.lcs.mit.edu>.
Current version: 3.1.
ftp://ftp.ai.mit.edu/pub/systems/t3.1.
A multiprocessing version of T is available
ftp://masala.lcs.mit.edu/pub/mult.
Runs on Decstation, SPARC, Sun-3, Vax under Unix, Encore, HP, Apollo, Macintosh
under A/UX.
E-mail: <t3-bugs@cs.yale.edu> (bugs). E-mail:
<t-project@cs.yale.edu>.
(1991-11-26)
["The T Manual", Johnathan A. Rees <jar@zurich.ai.mit.edu> et al, Yale
U, 1984].
2. A functional language.
["T: A Simple Reduction Language Based on Combinatory Term Rewriting", Ida et
al, Proc of Prog Future Generation Computers, 1988].
3. (lower case) The Lisp atom used to represent "true", among other things.
"false" is represented using the same atom as an empty list, nil. This
overloading of the basic constants of the language helps to make Lisp write-only
code.
4. In transaction-processing circles, an abbreviation for "transaction".
5. (Purdue) An alternative spelling of "tee".
Nearby terms:
systolic array « SysVile « sz « T » \t » T1 »
T1 line
|
