Difference between revisions of "On Compiling Rewriting Logic Language Definitions into Competitive Interpreters"

From FSL
Jump to: navigation, search
Line 1: Line 1:
 
<purge></purge>
 
<purge></purge>
 
<private>==Submitted to K==</private>
 
<private>==Submitted to K==</private>
<pub id='ilseman-ellison-2011-k' template='PubDefaultWithAbstractAndTitle'></pub>
+
<pub id='ilseman-ellison-2011-k-submission' template='PubDefaultWithAbstractAndTitle'></pub>
 
<private>==Technical Report==</private>
 
<private>==Technical Report==</private>
 
<pub id='ilseman-ellison-rosu-2010-tr' template='PubDefaultWithAbstractAndTitle'></pub>
 
<pub id='ilseman-ellison-rosu-2010-tr' template='PubDefaultWithAbstractAndTitle'></pub>

Revision as of 23:08, 8 June 2012



On Compiling Rewriting Logic Language Definitions into Competitive Interpreters
Michael Ilseman, Chucky Ellison and Grigore Rosu
Technical Report http://hdl.handle.net/2142/17444, December 2010
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.
PDF, TR@UIUC, Compiler Webpage, BIB

Personal tools
Namespaces

Variants
Actions
Navigation