21-letter words containing l, a, o, n
- 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.
- voice-stress analyzer — a machine purported to detect stress in a human voice and to ascertain a person's truthfulness.
- 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
- voluntary association — a group of individuals joined together on the basis of mutual interest or common objectives, especially a business group that is not organized or constituted as a legal entity.
- voluntary liquidation — the process of voluntarily terminating the affairs of a business, firm, etc, by realizing its assets to discharge its liabilities or the state of a business firm, etc, having its affairs so terminated
- 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.
- west lothian question — the apparent inconsistency that members of parliament who represent Scottish constituencies are eligible to vote at Westminster on matters that relate only to England, whereas members of parliament from English constituencies are not eligible to vote on Scottish matters
- wholesale price index — an indicator of price changes in the wholesale market
- william the conqueror — ("the Conqueror") 1027–87, duke of Normandy 1035–87; king of England 1066–87 (son of Robert I, duke of Normandy).
- without qualification — If something is stated or accepted without qualification, it is stated or accepted as it is, without the need for any changes.
- xilinx netlist format — (language, electronics) (XNF) A Hardware Description Language for electronic circuit design, developed by Xilinx, Inc..