Title of article :
Calculating Sized Types
Author/Authors :
Chin، Wei-Ngan نويسنده , , Khoo، Siau-Cheng نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
-61
From page :
62
To page :
0
Abstract :
Many prograni optimisations and analyses, such as arraybound checking, termination analysis, etc, depend on knowing the size of a functionʹs input and output. However, size information can be difficult to compute. Firstly, accurate size computation requires detecting size relation between different inputs of a function. Secondly, different optimisations and analyses may require slightly different size information, and thus slightly different computation. Literature in size computation has mainly concentrated on size checking, instead of inferencing. In this paper, we provide a generic framework on which different size variants can be expressed and computed. We also describe an effective algorithm for inferring, instead of checking, size information. Size information are expressed in terms of Presburger formulae, and our algorithm utilises the Omega Calculator to compute as exact a size information as possible, within the linear arithmetic capability.
Keywords :
Visitor Pattern , Recursive Programming , Separation of Concerns
Journal title :
A C M Sigplan (Programming Languages) Sigplan Notices
Serial Year :
1999
Journal title :
A C M Sigplan (Programming Languages) Sigplan Notices
Record number :
17098
Link To Document :
بازگشت