Inria / Raweb 2004
Project-Team: CALLIGRAMME

Search in Activity Report, year 2004:
HELP

INDEX

Project-Team : calligramme

Section: Application Domains


Termination and complexity of programs

The theory of implicit complexity is quite new and there are still many things to do. So, it is really important to translate current theoretical tools into real applications; this should allow to validate and guide our hypotheses. In order to do so, three directions are being explored.

  1. First order functional programming. A first prototype, called Icar has been developed and should be integrated into Elan (http://elan.loria.fr).

  2. Extracting programs from proofs. Here, one should build logical theories in which programs extracted via the Curry-Howard isomorphism are efficient.

  3. Application to mobile code system. This work starts in collaboration with the INRIA Crystal and Mimosa project-teams.


previous
next