On Compiling Rewriting Logic Language Definitions into Competitive Interpreters

Ilseman, Michael; Ellison, Chucky M.; Rosu, Grigore

Permalink

https://hdl.handle.net/2142/17444 Copy

Description

Title

On Compiling Rewriting Logic Language Definitions into Competitive Interpreters

Author(s)

• Ilseman, Michael
• Ellison, Chucky M.
• Rosu, Grigore

Issue Date

2010-12-14

Keyword(s)

• K
• Rewriting Logic
• formal semantics
• interpreters

Abstract

This paper describes a completely automated method for generating efficient and competitive interpreters from formal semantics expressed in Rewriting Logic. The semantics are compiled into OCaml code, which then acts as the interpreter for the language being defined. This automatic translation is tested on the semantics of an imperative as well as a functional language, and these generated interpreters are then benchmarked across a number of programs. In all cases the compiled interpreter is faster than directly executing the definition in a Rewriting system with improvements of several orders of magnitude.

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/17444

Owning Collections