Polynomial size analysis of first-order functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4583 LNCS, Issue , 2007, Pages 351-365

  Shkaravska, Olha ^a   Van Kesteren, Ron ^a   Van Eekelen, Marko ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Diophantine equations; Shapely functions; Size analysis; Type checking

Indexed keywords

FUNCTIONS; NUMERICAL METHODS; PROBLEM SOLVING;

DIOPHANTINE EQUATIONS; SHAPELY FUNCTIONS; SIZE ANALYSIS; TYPE CHECKING;

POLYNOMIALS;

EID: 38149015559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73228-0_25     Document Type: Conference Paper

References (12)

1. Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations, a way to control resources. Theoretical Computer Science (to appear)
2. Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science 6, 579-612 (1996)
3. Chatterjee, S., Blelloch, G.E., Fischer, A.L.: Size and access inference for dataparallel programs. PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, pp. 130-144 (1991)
4. s. Nonlinear and convex analysis, pp. 23-35 (1987)
5. Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. SIGPLAN Not. 38(1), 185-197 (2003)
6. Herrmann, C.A., Lengauer, C.: A transformational approach which combines size inference and program optimization. In: Taha, W. (ed.) SAIG 2001. LNCS, vol. 2196, pp. 199-218. Springer, Heidelberg (2001)
7. Jay, C.B., Sekanina, M.: Shape checking of array programs. In: Computing: the Australasian Theory Seminar, Proceedings. Australian Computer Science Communications, vol. 19, pp. 113-121 (1997)
8. Pareto, L.: Sized Types. Dissertation for the Licentiate Degree in Computing Science. Chalmers University of Technology (1998)
9. Lorenz, R.A.: Multivariate Birkhoff Interpolation. LNCS, vol. 1516. Springer, Heidelberg (1992)
10. Matiyasevich, Y., Jones, J.-P.: Proof or recursive unsolvability of Hilbert's tenth problem. American Mathematical Monthly 98(10), 689-709 (1991)
11. Shkaravska, O., van Kesteren, R., van Eekelen, M.: polynomial size analysis of first-order functions. Technical Report ICIS-R07004, Radboud University Nijmegen (2007)
12. Vasconcelos, P.-B., Hammond, K.: Inferring cost equations for recursive, polymorphic and higher-order functional programs (Revised Papers). In: Trinder, P., Michaelson, G.J., Peña, R. (eds.) IFL 2003. LNCS, vol. 3145, pp. 86-101. Springer, Heidelberg (2004)