RETE Project Part 1
Posted on 2016-04-10
Tags: RETE, OPS5, rules, rewriting
This sequence will look at the implementation of the RETE algorithm. RETE is a pattern matching algorithm that is optimized by reusing partial matches. The motivation for this project is to bring optimized rule matching to Haskell.
(will be edited throughout project)
Implement an OPS5 DSL. A good manual. Currently learning and using compdata - paper. Perhaps compdata-param - paper.
Should we just use a BNF converter? Almost a BNF expression.
Use ho-rewriting - paper or Yicho
There are various implementations that may be of interest; RETE and LEAPS.