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-PrologBut 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 By Metafont 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)