Skip to Main content Skip to Navigation
Conference papers

Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs

Guillaume Bonfante 1 Jean-Yves Marion 1 Romain Péchoux 1
1 CARTE - Theoretical adverse computations, and safety
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est
Abstract : Quasi-interpretations have shown their interest to deal with resource analysis of first order functional programs. There are at least two reasons to study the question of modularity of quasi-interpretations. Firstly, modularity allows to decrease the complexity of the quasi-inter\-pretation search algorithms. Secondly, modularity allows to increase the intentionality of the quasi-interpretation method, that is the number of captured programs. In particular, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher order programs. In this paper, we study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions. We show that in the case of constructor-sharing and hierarchical unions, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs.
Document type :
Conference papers
Complete list of metadatas
Contributor : Romain Péchoux <>
Submitted on : Wednesday, February 14, 2007 - 2:00:33 PM
Last modification on : Tuesday, May 5, 2020 - 5:02:07 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:55:47 PM


Files produced by the author(s)


  • HAL Id : inria-00130920, version 1



Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux. Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs. ICTAC, Sep 2007, Macao, China. ⟨inria-00130920⟩



Record views


Files downloads