Révision 219 CSL17/ph-biblio.bib
| ph-biblio.bib (revision 219) | ||
|---|---|---|
| 1 |
@incollection{bellantoni1995fph,
|
|
| 2 |
title={Predicative recursion and the polytime hierarchy},
|
|
| 3 |
author={Bellantoni, Stephen},
|
|
| 4 |
booktitle={Feasible Mathematics II},
|
|
| 5 |
pages={15--29},
|
|
| 6 |
year={1995},
|
|
| 7 |
publisher={Springer}
|
|
| 8 |
} |
|
| 1 | 9 |
|
| 2 | 10 |
|
| 3 |
@inproceedings{Lasson11,
- author = {Marc Lasson},
- title = {Controlling Program Extraction in Light Logics},
- booktitle = {Proceedings of Typed Lambda Calculi and Applications - 10th International Conference,
- {TLCA} 2011},
- pages = {123--137},
- series = {LNCS},
- volume = {6690},
- publisher = {Springer},
- year = {2011}
- }
-
|
|
| 4 |
@inproceedings{Leivant95,
- author = {Daniel Leivant},
+@inproceedings{Lasson11,
|
|
| 11 |
author = {Marc Lasson},
|
|
| 12 |
title = {Controlling Program Extraction in Light Logics},
|
|
| 13 |
booktitle = {Proceedings of Typed Lambda Calculi and Applications - 10th International Conference,
|
|
| 14 |
{TLCA} 2011},
|
|
| 15 |
pages = {123--137},
|
|
| 16 |
series = {LNCS},
|
|
| 17 |
volume = {6690},
|
|
| 18 |
publisher = {Springer},
|
|
| 19 |
year = {2011}
|
|
| 20 |
} |
|
| 21 |
|
|
| 22 |
@inproceedings{Leivant95,
|
|
| 23 |
author = {Daniel Leivant},
|
|
| 5 | 24 |
title = {Ramified recurrence and computational complexity I: Word recurrence and poly-time},
|
| 6 | 25 |
booktitle = {Feasible mathematics II},
|
| 7 |
pages = {320--343},
- publisher = {Birkhauser Boston},
- year = {1995},
+ pages = {320--343},
|
|
| 26 |
publisher = {Birkhauser Boston},
|
|
| 27 |
year = {1995},
|
|
| 8 | 28 |
} |
| 9 | 29 |
|
| 10 |
@inproceedings{Marion11,
- author = {Jean{-}Yves Marion},
- title = {A Type System for Complexity Flow Analysis},
- booktitle = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
- Science, {LICS} 2011},
- pages = {123--132},
- publisher = {{IEEE} Computer Society},
- year = {2011},
- }
|
|
| 30 |
@inproceedings{Marion11,
|
|
| 31 |
author = {Jean{-}Yves Marion},
|
|
| 32 |
title = {A Type System for Complexity Flow Analysis},
|
|
| 33 |
booktitle = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
|
|
| 34 |
Science, {LICS} 2011},
|
|
| 35 |
pages = {123--132},
|
|
| 36 |
publisher = {{IEEE} Computer Society},
|
|
| 37 |
year = {2011},
|
|
| 38 |
} |
|
| 11 | 39 |
|
| 12 |
@article{Hofmann03,
- author = {Martin Hofmann},
- title = {Linear types and non-size-increasing polynomial time computation},
- journal = {Inf. Comput.},
- volume = {183},
- number = {1},
- pages = {57--85},
- year = {2003}
- }
|
|
| 40 |
@article{Hofmann03,
|
|
| 41 |
author = {Martin Hofmann},
|
|
| 42 |
title = {Linear types and non-size-increasing polynomial time computation},
|
|
| 43 |
journal = {Inf. Comput.},
|
|
| 44 |
volume = {183},
|
|
| 45 |
number = {1},
|
|
| 46 |
pages = {57--85},
|
|
| 47 |
year = {2003}
|
|
| 48 |
} |
|
| 13 | 49 |
|
| 14 |
@article{OstrinWainer05,
- author = {Geoffrey E. Ostrin and
- Stanley S. Wainer},
- title = {Elementary arithmetic},
- journal = {Ann. Pure Appl. Logic},
- volume = {133},
- number = {1-3},
- pages = {275--292},
- year = {2005}
- }
-
|
|
| 50 |
@article{OstrinWainer05,
|
|
| 51 |
author = {Geoffrey E. Ostrin and
|
|
| 52 |
Stanley S. Wainer}, |
|
| 53 |
title = {Elementary arithmetic},
|
|
| 54 |
journal = {Ann. Pure Appl. Logic},
|
|
| 55 |
volume = {133},
|
|
| 56 |
number = {1-3},
|
|
| 57 |
pages = {275--292},
|
|
| 58 |
year = {2005}
|
|
| 59 |
} |
|
| 15 | 60 |
|
| 61 |
|
|
| 16 | 62 |
@article{GaboardiMarionRonchi12,
|
| 17 | 63 |
author = {Marco Gaboardi and
|
| 18 | 64 |
Jean{-}Yves Marion and
|
Formats disponibles : Unified diff