RETE Project Part 1

Posted on 2016-04-10 by tomberek
Tags: RETE, OPS5, rules, rewriting
Category: RETE

Introduction

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.

The Plan

(will be edited throughout project)

OPS5

Implement an OPS5 DSL. A good manual. Currently learning and using compdata - paper. Perhaps compdata-param - paper.

Another Summary

Should we just use a BNF converter? Almost a BNF expression.

Rules

Use ho-rewriting - paper or Yicho

RETE

There are various implementations that may be of interest; RETE and LEAPS.

LEAPS

Another?

Venus

Haskell Rules Framework

???

Profit