0%

21-letter words containing m, e, l, a, n, o

  • to lay something bare — If you lay something bare, you uncover it completely so that it can then be seen.
  • to live hand to mouth — If someone lives hand to mouth or lives from hand to mouth, they have hardly enough food or money to live on.
  • to make a mental note — If you make a mental note of something, you make an effort to store it in your memory so that you will not forget it.
  • to risk life and limb — If someone risks life and limb, they do something very dangerous that may cause them to die or be seriously injured.
  • tool command language — (language)   /tik*l/ (Tcl) An interpreted string processing language for issuing commands to interactive programs, developed by John Ousterhout at UCB. Each application program can extend tcl with its own set of commands. Tcl is like a text-oriented Lisp, but lets you write algebraic expressions for simplicity and to avoid scaring people away. Though originally designed to be a "scripting language" rather than for serious programming, Tcl has been used successfully for programs with hundreds of thousands of lines. It has a peculiar but simple syntax. It may be used as an embedded interpreter in application programs. It has exceptions and packages (called libraries), name-spaces for procedures and variables, and provide/require. It supports dynamic loading of object code. It is eight-bit clean. It has only three variable types: strings, lists and associative arrays but no structures. Tcl and its associated GUI toolkit, Tk run on all flavors of Unix, Microsoft Windows, Macintosh and VMS. Tcl runs on the Amiga and many other platforms. See also expect (control interactive programs and pattern match on their output), Cygnus Tcl Tools, [incr Tcl] (adds classes and inheritence to Tcl), Scriptics (John Ousterhout's company that is the home of Tcl development and the TclPro tool suite), Tcl Consortium (a non-profit agency dedicated to promoting Tcl), tclhttpd (an embeddable Tcl-based web server), tclx (adds many commands to Tcl), tcl-debug.
  • transformational rule — Linguistics. a rule of transformational grammar that relates two phrase markers in the course of a derivation from the deep to the surface syntactic representation of a sentence, as by reordering, inserting, or deleting elements; a rule that converts deep structures into surface structures.
  • trichloronitromethane — chloropicrin.
  • ultraviolet astronomy — the branch of astronomy that deals with celestial objects emitting electromagnetic radiation in the ultraviolet range.
  • universal disk format — (storage, standard)   (UDF) A CD-ROM file system standard that is required for DVD ROMs. UDF is the OSTA's replacement for the ISO 9660 file system used on CD-ROMs, but will be mostly used on DVD. DVD multimedia disks use UDF to contain MPEG audio and video streams. To read DVDs you need a DVD drive, the kernel driver for the drive, MPEG video support, and a UDF driver. DVDs containing both UDF filesystems and ISO 9660 filesystems can be read without UDF support. UDF can also be used by CD-R and CD-RW recorders in packet writing mode.
  • vladivostok agreement — a preliminary arms control accord concluded by Soviet leader Leonid Brezhnev and U.S. President Gerald Ford in Vladivostok, U.S.S.R., in December 1974.
  • voluntary arrangement — a procedure enabling an insolvent company to come to an arrangement with its creditors and resolve its financial problems, often in compliance with a court order
  • volunteers of america — a religious reform and relief organization, similar to the Salvation Army, founded in New York City in 1896 by Ballington Booth, son of William Booth, the founder of the Salvation Army. Abbreviation: VOA.
  • warm silence software — A small company run by(?) Robin Watts, producing software for the Acorn Archimedes.
  • weak head normal form — (reduction, theory)   (WHNF) A lambda expression is in weak head normal form (WHNF) if it is a head normal form (HNF) or any lambda abstraction. I.e. the top level is not a redex. The term was coined by Simon Peyton Jones to make explicit the difference between head normal form (HNF) and what graph reduction systems produce in practice. A lambda abstraction with a reducible body, e.g. \ x . ((\ y . y+x) 2) is in WHNF but not HNF. To reduce this expression to HNF would require reduction of the lambda body: (\ y . y+x) 2 --> 2+x Reduction to WHNF avoids the name capture problem with its need for alpha conversion of an inner lambda abstraction and so is preferred in practical graph reduction systems. The same principle is often used in strict languages such as Scheme to provide call-by-name evaluation by wrapping an expression in a lambda abstraction with no arguments: D = delay E = \ () . E The value of the expression is obtained by applying it to the empty argument list:
  • weinberg-salam theory — electroweak theory.
  • william the conqueror — ("the Conqueror") 1027–87, duke of Normandy 1035–87; king of England 1066–87 (son of Robert I, duke of Normandy).
  • xilinx netlist format — (language, electronics)   (XNF) A Hardware Description Language for electronic circuit design, developed by Xilinx, Inc..
Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?