The Subset-equational language (SEL) is a declarative programming language for set processing, written by Bharat Jayaraman.

PropertyValue
p:abstract
  • The Subset-equational language (SEL) is a declarative programming language for set processing, written by Bharat Jayaraman. Features include: *subset and equational program clauses. *pattern matching over sets (supporting efficient iteration over sets). *annotations to say which functions distribute over union in which arguments (for point-wise/incremental computation over sets). *defining transitive closures through circular constraints (implemented by mixed top-down/memoisation and bottom-up strategy). *metaprogramming and simple higher-order programming. *modest user-interface including tracing. The SEL compiler, written in Quintus Prolog, generates WAM-like code, extended to deal with set-matching, memoisation, and the novel control structure of the language. The run-time system is written in C. (en)
p:hasPhotoCollection
rdfs:comment
  • The Subset-equational language (SEL) is a declarative programming language for set processing, written by Bharat Jayaraman. (en)
rdfs:label
  • Subset-equational language (en)
skos:subject
foaf:page