filter := lambda i . begin   

        o #= a + b + c + d;

        a := i - b;

        b := 0 followed-by d;

        c := a - e;

        d := c + e;

        e := 0 followed-by c;

      end;

 FEATURES
  • equational language (what without how)
  • polymorphic: the input i could be or not typed
  • undependant from the algebra: data types and operators are dynamically loaded into the compiler. They extend the reconized tokens of the language
  • full modular design

  • programmed with C for DOS/WINDOWS and Unix
  • based of a semantics language named Lambda-Matrices. It allows the formal verifications of the Lambda-Flow design