| PLUME |  |
| PLUME | |
| HAL : hal-00605654, version 1 |
| DOI : 10.1007/978-3-642-21691-6 |
| Fiche détaillée |  Récupérer au format |
 |
| Typed Lambda Calculi and Applications 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011., Novi Sad : Serbie (2011) |
|
|
|
|
| Controlling Program Extraction in Light Logics |
|
|
| Marc Lasson 1 |
|
|
| complice Collaboration(s) |
|
|
| (12/06/2011) |
|
|
|
| We present two refinements, based on program extraction in elementary affine logic and light affine logic, of Krivine & Leivant's system FA2. This system allows higher-order equations to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms. The system guarantees that the extracted program satisfies the specification and is computable in elementary time (for elementary affine logic) or polynomial time (for light affine logic). Finally, we show that both systems are complete with respect to elementary time and polynomial time functions. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire de l'Informatique du Parallélisme (LIP) |
|
|
|
Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| Extraction – Implicit Complexity – Elementary Linear Logic – Light Linear Logic |
|
| hal-00605654, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00605654 | |
| oai:hal.archives-ouvertes.fr:hal-00605654 | |
| Contributeur : Marc Lasson | |
| Soumis le : Dimanche 3 Juillet 2011, 17:26:37 | |
| Dernière modification le : Dimanche 3 Juillet 2011, 17:26:37 | |
