LiLFeS: Tips for Efficiency
Integration of a frequently used instruction sequence into an new instruction.
- One instruction for a node without any features. (Usually, one node requires at least three instructions.)
Elimination of branch instructions
- Abstract interpretation of LiLFeS source code
Usual optimization techniques for Prolog
- tail recursion
- indexing of definite clauses