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 Prolog resolution 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 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)

In addition suitable contents:
[ 2 ] [ = ] [ ACM ] [ af ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ B ] [ b ] [ be ] [ bi ] [ bit ] [ by ] [ C ] [ ca ] [ cat ] [ ch ] [ ci ] [ cl ] [ CM ] [ co ] [ com ] [ con ] [ conjunction ] [ cons ] [ constraint ] [ C-Prolog ] [ cu ] [ D ] [ de ] [ ding ] [ do ] [ doc ] [ document ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ event ] [ fi ] [ file ] [ fo ] [ font ] [ for ] [ Fun ] [ function ] [ G ] [ ge ] [ gh ] [ gi ] [ gr ] [ graph ] [ gu ] [ guard ] [ h ] [ hr ] [ Id ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ K ] [ la ] [ language ] [ leaf ] [ Lex ] [ li ] [ lu ] [ lv ] [ ly ] [ M ] [ ma ] [ Miranda ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ne ] [ net ] [ nf ] [ ng ] [ ni ] [ nn ] [ no ] [ norm ] [ ns ] [ nu ] [ om ] [ pa ] [ pe ] [ ph ] [ pl ] [ pr ] [ Prolog ] [ query ] [ rc ] [ re ] [ resolution ] [ ro ] [ roff ] [ S ] [ sc ] [ se ] [ set ] [ so ] [ solution ] [ Spec ] [ st ] [ T ] [ to ] [ tr ] [ tt ] [ tw ] [ type ] [ ua ] [ um ] [ unification ] [ V ] [ va ] [ ve ]