| Gianni Bell and Eugenio Moggi. Typed intermediate languages for shape-analysis. In Typed Lambda Calculi and Applications (TLCA'97), Lecture Notes in Computer Science 1210, pages 1129. Springer-Verlag, 1997. |
....subsequent program transformations are performed in a cycle and, thus, functions are analyzed that never existed in the source program. 2. Other researchers base size analysis, be it inference or checking, on types. a) Some groups draw a strong connection between types and sizes. Bell and Moggi [2] apply size inference in an intermediate language with a two level type system that distinguishes between compile time and runtime values [27] Xi and Pfenning [32] use dependent types and perform type checking modulo constraint satisfaction. Singleton types enable the generation of lists of a ....
....the size analysis may fail but the program may still be typable. In all other static approaches whichwe are aware of size inference is decidable. Chin and Khoo [6] Fradet and Mallet [12] and Xi and Pfenning [32] use linear inequalities for constraints, i.e. Presburger arithmetic. Bell and Moggi [2], Jay and Sekanina [23] and Hofmann [21] achieve the decidability through their type system. Limitation to Presburger arithmetic already rules out the following simple function # which is likely to appear in an # body computation: # takes a list of size # as input and produces a list that ....
Gianni Bell and Eugenio Moggi. Typed intermediate languages for shape-analysis. In TypedLambda Calculi and Applications (TLCA'97), Lecture Notes in Computer Science 1210, pages 1129. Springer-Verlag, 1997.
No context found.
Gianni Bell and Eugenio Moggi. Typed intermediate languages for shape-analysis. In Typed Lambda Calculi and Applications (TLCA'97), Lecture Notes in Computer Science 1210, pages 1129. Springer-Verlag, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC