Refine

Cordell Green et al, Stanford U

A high-level wide-spectrum specification language. It has set-theoretic date types (sets, mappings, sequences) and first-order logic (for all, there exists). Syntax-directed pattern matching, type inference, and a declarative transformation operator (pre- and post-conditions). Implemented as a set of algorithms which build and transform annotated abstract syntax trees. Compiled into Common LISP. See CHI.

"Research on Knowledge-Based Software Environments at Kestrel Institute", D. R. Smith et al, IEEE Transactions on Soft Engineering, SE-11(11) (1985).