Generalized boxings, congruences and partial inlining
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 147-161
- https://doi.org/10.1007/3-540-58485-4_38
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Call forwardingPublished by Association for Computing Machinery (ACM) ,1994
- Formally optimal boxingPublished by Association for Computing Machinery (ACM) ,1994
- Dependence-based program analysisPublished by Association for Computing Machinery (ACM) ,1993
- Unboxed objects and polymorphic typingPublished by Association for Computing Machinery (ACM) ,1992
- An efficient method of computing static single assignment formPublished by Association for Computing Machinery (ACM) ,1989
- Detecting equality of variables in programsPublished by Association for Computing Machinery (ACM) ,1988
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964