Welcome to the Meta-Maudest home page!!
Meta-Maudest is an application implementing a narrowing-based, fold/unfold-based transformation framework for rewriting logic theories. Meta-Maudest is written in the high-performance, rewriting logic language Maude.
After providing an initial, maybe inefficient, program, you can transform it by
using some elementary transformation rules. The essential rules are folding and
unfolding, i.e., contraction and expansion of subexpressions of a program using
the definitions of the program itself (or of a preceding one).
For the best of our knowledge, this is the first fold/unfold transformation framework which allows one to deal with functions, rules, equations, sorts, and algebraic laws (such as conmutativity and associativity).
The transformation metodology can be naturally applied to implement a Code Carrying Theory (CCT) system as shown in the following paper: A Fold/Unfold Transformation Framework for Rewrite Theories extended to CCT In Proc. of ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM'10), Madrid (Spain), 2010 [pdf].