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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]