Resumen:
Partial Evaluation of Order-sorted Equational Programs modulo Axioms

Fecha

2017-07-19

Editor

Sistedes

Publicado en

Actas de las XVII Jornadas de Programación y Lenguajes (PROLE 2017)

Licencia Creative Commons

Resumen

Partial evaluation (PE) is a powerful and general program optimization technique with many successful applications. However, it has never been investigated in the context of expressive rule-based languages like Maude, CafeOBJ, OBJ, ASF+SDF, and ELAN, which support: rich type structures with sorts, subsorts and overloading; and equational rewriting modulo axioms such as commutativity, associativity–commutativity, and associativity–commutativity–identity. In this paper, we illustrate the key concepts by showing how they apply to partial evaluation of expressive rule-based programs written in Maude. Our partial evaluation scheme is based on an automatic unfolding algorithm that computes term variants and relies on equational least general generalization for ensuring global termination. We demonstrate the use of the resulting partial evaluator for program optimization on several examples where it shows significant speed-ups.

Descripción

Acerca de Alpuente, María

Palabras clave

Equational Rewriting Modulo Axioms, Maude, Partial Evaluation, Rewriting Logic
Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX