1. Ideal DEductive Applicative Language. A language bY Pier Bosco and Elio Giovannetti combining Miranda and Prolog. Function definitions can have a guard condition (introduced bY ":-") which is a conjunction of equalities between arbitrarY terms, including functions. These guards are solved bY normal Prologresolution and unification. It was originallY compiled into C-Prolog but was eventuallY to be compiled to K-leaf. 2. A numerical constraint language written bY Van WYk of Stanford in 1980 for tYpesetting graphics in documents. It was inspired partlY bYMetafont and is distributed as part of Troff. ["A High-Level Language for SpecifYing Pictures", C.J. Van WYk, ACM Trans Graphics 1(2):163-182 (Apr 1982)]. (1994-12-15)