RSS for Towards an Intermediate Language based on Graph Rewritinghttp://academic.research.microsoft.com/Rss.aspx?cata=9&id=627026Search RSS feed for Microsoft Academic SearchMSRA Libra RSS Burner(c)2008 Microsoft Corpration, All right reserved.Thu, 20 Jun 2013 07:51:11 GMTThu, 20 Jun 2013 07:51:11 GMTTowards an Intermediate Language based on Graph Rewritinghttp://academic.research.microsoft.com/Publication/627026Thu, 20 Jun 2013 00:51:10 GMT62702626Hendrik Pieter Barendregt, Marko C. J. D. Van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep: (Citations:26)view publication
Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constructs and allows the manipulation of cyclic graphs. Programs may exhibit non-determinism as well as parallelism. In particular, Lean can serve as an intermediate language between declarative languages and machine architectures, both sequential and parallel.
]]>