Compilation of Functional Languages Using Flow Graph Analysis (1994)
Cached
Download Links
- [www.cs.ubc.ca]
- [hpc.doc.ic.ac.uk]
- [ftp.wins.uva.nl]
- DBLP
Other Repositories/Bibliography
by
Pieter H. Hartel
,
Hugh Glaser
,
John M. Wild
| Citations: | 16 - 12 self |
BibTeX
@MISC{Hartel94compilationof,
author = {Pieter H. Hartel and Hugh Glaser and John M. Wild},
title = {Compilation of Functional Languages Using Flow Graph Analysis},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
syntax, and syntactic and semantic domains of a flow graph Figure 9. Semantic equations Def and Exp of a flow graph The first argument to the functions Def and Exp specifies a set of nodes that represent a flow graph, from which the element(s) of current interest are selected by pattern matching.
