Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language | Zendy

Barış Aktemur | Zendy; Sam Kamin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language

Author(s) -

Barış Aktemur,

Sam Kamin

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.06.036

Subject(s) - computer science , compiler , programming language , rewriting , partial evaluation , java , code generation , simple (philosophy) , dynamic compilation , optimizing compiler , just in time compilation , code (set theory) , parallel computing , operating system , philosophy , set (abstract data type) , epistemology , key (lock)

We describe our efforts to use rule-based programming to produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo incorporates RTPG following the simple principle that the regular compiler — or, rather, its back-end — can be used both for ordinary, static compilation and for run-time compilation. This tends to produce a run-time compiler that is inefficient but potentially subject to improvement by partial evaluation. However, the complexity of the language and compiler have made it difficult for us to achieve actual optimization. The model, written in Maude, preserves all the essential ingredients of Jumbo, but operates on a simplified language, called Mumbo. The simplification in the language together with Maude's support for code rewriting has allowed us to make rapid progress. We discuss the model in detail, the kinds of optimizations we have obtained, and the impact on the Jumbo project

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research