Preproceedings of the 22 nd Symposium on Implementation and Application of Functional Languages ( IFL 2010 )

Abstract

The paper presents preliminary results in automatic inference of size invariants, and of ranking functions proving termination of functional programs, by adapting linear techniques developed for other languages. The results are promising and allow to solve some problems left open in previous works on automatic inference of safe memory bounds.

Cite this paper

@inproceedings{Hage2010PreproceedingsOT, title={Preproceedings of the 22 nd Symposium on Implementation and Application of Functional Languages ( IFL 2010 )}, author={Jurriaan Hage}, year={2010} }