Skip to Main content Skip to Navigation
Conference papers

Synthesis of Quasi-interpretations

Guillaume Bonfante 1 Jean-Yves Marion 1 Jean-Yves Moyen 1 Romain Péchoux 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper presents complexity results by showing that the synthesis of MaxPoly quasi-interpretations over reals is decidable in exponential time with fixed polynomial degrees and fixed max-degree and that the synthesis ofMaxPlus quasi-interpretations over reals is NPtime-complete with fixed multiplicative degrees and fixed max-degree. Quasi-interpretations are a tool that allows to control resources like the runtime, the runspace or the size of a result in a program execution. Quasi-interpretations assign to each program symbol a numerical function which is compatible with the computational semantics and roughly speaking provide an upper bound on sizes of intermediate values computed.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Thursday, November 10, 2005 - 11:31:59 PM
Last modification on : Friday, February 4, 2022 - 3:30:11 AM
Long-term archiving on: : Tuesday, September 7, 2010 - 4:27:50 PM


  • HAL Id : inria-00000660, version 1



Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, Romain Péchoux. Synthesis of Quasi-interpretations. Seventh International Workshop on Logic and Computational Complexity - LCC 2005, Jun 2005, Chicago/USA. ⟨inria-00000660⟩



Record views


Files downloads