Science Fair Project Encyclopedia
Subset-equational language
The Subset-equational language (SEL) is a declarative programming language for set processing by Bharat Jayaraman .
Features of SEL 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.
09-23-2007 01:00:40
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details