0%

21-letter words containing o, k, d

  • round-necked pullover — a sweater with a plain round neckline
  • s-k reduction machine — An abstract machine defined by Professor David Turner to evaluate combinator expressions represented as binary graphs. Named after the two basic combinators, S and K.
  • safe in the knowledge — If you do something safe in the knowledge that something else is the case, you do the first thing confidently because you are sure of the second thing.
  • school of hard knocks — the experience gained from living, especially from disappointment and hard work, regarded as a means of education: The only school he ever attended was the school of hard knocks.
  • skop, skiet en donder — violent action and melodramatic adventure in a film
  • stock list department — (in an American stock exchange) the department dealing with monitoring compliance with its listing requirements and rules
  • stockholder of record — a stockholder or his or her agent whose name is registered on the books of the issuing corporation at the close of a business day set for determining that stockholders shall receive dividends or vote on an issue.
  • stokes-adams syndrome — unconsciousness accompanying atrioventricular heart block, sometimes characterized by weakness, irregular pulse, and intermittent convulsive or nonconvulsive seizures.
  • take sb at their word — If you take someone at their word, you believe what they say, when they did not really mean it or when they meant something slightly different.
  • the break of day/dawn — The break of day or the break of dawn is the time when it begins to grow light after the night.
  • the yellow brick road — the road to success or happiness (in the film the Wizard of Oz the yellow brick road leads to Oz)
  • think outside the box — to think in a different, innovative, or original manner, esp with regard to business practices, products, systems, etc
  • three-toed woodpecker — either of two woodpeckers of the genus Picoides, of the Northern Hemisphere, having only three toes on each foot.
  • to be hard luck on sb — to be unfortunate or unlucky for someone
  • to be killed outright — If someone is killed outright, they die immediately, for example in an accident.
  • to hit the bookstands — (of a book) to be published
  • to kill a mockingbird — a novel (1960) by Harper Lee.
  • to know your own mind — If you know your own mind, you are sure about your opinions, and are not easily influenced by other people.
  • 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.
  • to stick in your mind — If something sticks in your mind, it remains firmly in your memory.
  • to take the high road — to take the course of action which is safest and most familiar
  • to take your mind off — If something takes your mind off a problem or unpleasant situation, it helps you to forget about it for a while.
  • 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.
  • 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:
Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?