Results 1 
5 of
5
Eekelen. Polynomial size analysis of firstorder functions
, 2007
"... Abstract. We present a sizeaware type system for firstorder shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be matrix multiplica ..."
Abstract

Cited by 25 (12 self)
 Add to MetaCart
(Show Context)
Abstract. We present a sizeaware type system for firstorder shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear or monotonic. Furthermore, a method that infers polynomial size dependencies for a nontrivial class of function definitions is suggested. 1
Eekelen, M.: Size analysis of algebraic data types
 Selected revised papers of the 9th international symposium on Trends in Functional Programming (TFP’08
, 2009
"... The following full text is a preprint version which may differ from the publisher's version. ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
The following full text is a preprint version which may differ from the publisher's version.
Type Checking and Weak Type Inference for Polynomial Size Analysis of FirstOrder Functions
"... Abstract. We present a sizeaware type system for firstorder shapely functions. Here, a function is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely functions are matrix multiplication and the Cartesian product of tw ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present a sizeaware type system for firstorder shapely functions. Here, a function is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely functions are matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear. Furthermore, an algorithm for weak type inference for this system is given. 1