\sˈʌbsɛtɪkwˈe͡ɪʃənə͡l lˈaŋɡwɪd͡ʒ], \sˈʌbsɛtɪkwˈeɪʃənəl lˈaŋɡwɪdʒ], \s_ˈʌ_b_s_ɛ_t_ɪ_k_w_ˈeɪ_ʃ_ə_n_əl l_ˈa_ŋ_ɡ_w_ɪ_dʒ]\
Definitions of SUBSET-EQUATIONAL LANGUAGE
Sort: Oldest first
(SEL) A declarative language for set processing by BharatJayaraman with subset and equational program clauses; patternmatching over sets (it supports efficient iteration oversets); annotations to say which functions distribute overunion in which arguments (for point-wise/incrementalcomputation over sets); defining transitive closures throughcircular constraints (implemented by mixedtop-down/memoisation and bottom-up strategy);meta-programming and simple higher-order programming;modest user-interface including tracing.The SEL compiler, written in Quintus Prolog, generatesWAM-like code, extended to deal with set-matching,memoisation, and the novel control structure of thelanguage. The run-time system is written in C. (ftp://ftp.cs.buffalo.edu/users/bharat/SEL2).E-mail: Bharat Jayaraman .["Towards a Broader Basis for Logic Programming",B. Jayaraman, TR CS Dept, SUNY Buffalo, 1990].["Set Abstraction in Functional and Logic Programming",F.S.K. Silbermann et al, ACM Proc 1989].
By Denis Howe