Laboratoire de l'Informatique et du Parallélisme » Linear Arithmetic

@inproceedings{Leivant95,
+  author    = {Daniel Leivant},
+  title     = {Ramified recurrence and computational complexity I: Word recurrence and poly-time},

  booktitle = {Feasible mathematics II}, 

    pages     = {320--343},
+   publisher = {Birkhauser Boston},
+  year      = {1995},
+ }

@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},
+ }

@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}
+  }