A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Time and tape complexity of pushdown automaton languages, Information and Control, vol.13, issue.3, pp.186-206, 1968.
DOI : 10.1016/S0019-9958(68)91087-5

T. Amtoft and J. Träff, Partial memoization for obtaining linear time behavior of a 2DPDA, Theoretical Computer Science 98, pp.347-356, 1992.
DOI : 10.1016/0304-3975(92)90008-4

N. Andersen and N. D. Jones, Generalizing Cook's transformation to imperative stack programs, Lecture Notes in Computer Science, vol.812, pp.1-18, 1994.
DOI : 10.1007/3-540-58131-6_33

C. Aubert and M. Bagnol, Unification and Logarithmic Space Lecture Notes in Computer Science, by Gilles Dowek, vol.8650, pp.77-92, 2014.

C. Aubert, M. Bagnol, P. Pistone, and T. Seiller, Logic Programming and Logarithmic Space, APLAS. Ed. by Jacques Garrigue, pp.39-57, 2014.
DOI : 10.1007/978-3-319-12736-1_3
URL : https://hal.archives-ouvertes.fr/hal-01309159

C. Aubert and T. Seiller, Characterizing co-NL by a group action, Mathematical Structures in Computer Science, vol.75, issue.04, 2014.
DOI : 10.1147/rd.105.0388
URL : https://hal.archives-ouvertes.fr/hal-01005705

C. Aubert and T. Seiller, Logarithmic Space and Permutations Information and Computation, Special Issue on Implicit Computational Complexity (2015)

F. Baader and T. Nipkow, Term rewriting and all that, pp.978-978, 1998.

M. Bagnol, On the Resolution Semiring
URL : https://hal.archives-ouvertes.fr/tel-01215334

P. Baillot and M. Pedicini, Elementary Complexity and Geometry of Interaction, Fundamenta Informaticae, vol.451, issue.2, pp.1-31, 2001.
DOI : 10.1007/3-540-48959-2_4
URL : https://hal.archives-ouvertes.fr/hal-00084631

P. Baillot and K. Terui, Light Types for Polynomial Time Computation in Lambda-Calculus, LICS. IEEE Computer Society, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00012752

J. Stephen, S. A. Bellantoni, and . Cook, A New Recursion-Theoretic Characterization of the Polytime Functions, Computational Complexity, vol.2, pp.97-110, 1992.

S. Arthur and C. , Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, Journal of the ACM, vol.181, 1971.

S. Arthur and C. , Linear Time Simulation of Deterministic Two-Way Pushdown Automata, pp.75-80, 1971.

U. Dal and L. , A Short Introduction to Implicit Computational Complexity, Lecture Notes in Computer Science, vol.7388, pp.89-109978, 2011.

U. Dal, L. , and U. Schöpp, Functional Programming in Sublinear Space, Lecture Notes in Computer Science, vol.6012, pp.205-225978, 2010.

V. Danos, La Logique Linéaire appliquée à l'étude de divers processus de normalisation (principalement du ? -calcul), 1990.

V. Danos and J. Joinet, Linear logic and elementary time, Information and Computation, vol.183, issue.1, pp.123-137, 2003.
DOI : 10.1016/S0890-5401(03)00010-5
URL : http://doi.org/10.1016/s0890-5401(03)00010-5

V. Danos and L. Regnier, Reversible, Irreversible and Optimal lambda- Machines, In: Theoretical Computer Science, vol.2271, issue.299, pp.79-97, 1999.
DOI : 10.1016/s0304-3975(99)00049-3
URL : http://doi.org/10.1016/s0304-3975(99)00049-3

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, In: ACM Computing Surveys, vol.333, pp.374-425, 2001.

C. Dwork, P. C. Kanellakis, and J. C. Mitchell, On the sequential nature of unification, The Journal of Logic Programming, vol.1, issue.1, pp.35-50, 1984.
DOI : 10.1016/0743-1066(84)90022-0

P. Van and E. Boas, Machine Models and Simulation In: Handbook of Theoretical Computer Science. volume A: Algorithms and Complexity. Handbook of Theoretical Computer Science. volume A: Algorithms and Complexity, pp.1-66, 1990.

M. Gaboardi, J. Marion, and S. Girard, An Implicit Characterization of PSPACE Geometry of Interaction V: logic in the hyperfinite factor): Girard's Festschrift, In: ACM Transactions on Computational Logic In: Theoretical Computer Science, vol.13220, issue.412, pp.1-18, 2011.

J. Girard, Geometry of interaction 1: Interpretation of System F " . In: Studies in Logic and the Foundations of, Mathematics, vol.127, issue.08, pp.221-260, 1989.

J. Girard, Geometry of interaction III: accommodating the additives Advances in Linear Logic Advances in Linear Logic Lecture Note Series 222, pp.329-389, 1995.

J. Girard, Light linear logic, by Daniel Leivant. Lecture Notes in Computer Science, vol.960, pp.145-176, 1995.
DOI : 10.1007/3-540-60178-3_83

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-101, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, Normativity in Logic Epistemology versus Ontology Logic, Epistemology, and the Unity of Science, Erik Palmgren, and Göran Sundholm, pp.243-263, 2012.

J. Girard, Logic and Computer Science Categories in Computer Science and Logic, Proceedings of the AMS Conference on Categories, 1989.

R. Glück, Simulation of Two-Way Pushdown Automata Revisited, Electronic Proceedings in Theoretical Computer Science. 2013, pp.250-258
DOI : 10.4204/EPTCS.129.15

J. Hartmanis, On non-determinancy in simple computing devices, Acta Informatica, vol.5, issue.4, pp.336-344, 1972.
DOI : 10.1007/BF00289513

M. Ladermann and H. Petersen, Notes on looping deterministic two-way pushdown automata, Information Processing Letters, vol.49, issue.3, pp.123-127, 1994.
DOI : 10.1016/0020-0190(94)90088-4

Y. Lafont, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, 2004.
DOI : 10.1016/j.tcs.2003.10.018
URL : http://doi.org/10.1016/j.tcs.2003.10.018

D. Leivant, Stratified functional programs and computational complexity, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, 1993.
DOI : 10.1145/158511.158659

D. Michie, ???Memo??? Functions and Machine Learning, Nature, vol.115, issue.5136, pp.19-22, 1968.
DOI : 10.1038/218019a0

N. Peter-møller, A Functional Language for Logarithmic Space, Lecture Notes in Computer Science, vol.3302, pp.311-326, 2004.

T. Seiller, A correspondence between maximal abelian sub-algebras and linear logic fragments, ArXiv preprint abs, 1408.
DOI : 10.2307/1968693

T. Seiller, Interaction Graphs, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2014.
DOI : 10.1145/2933575.2934568
URL : https://hal.archives-ouvertes.fr/hal-01159218

T. Seiller, Logique dans le facteur hyperfini : géometrie de l'interaction et complexité

K. W. Wagner and G. Wechsung, Mathematics and its Applications, Computational Complexity, vol.21, p.9789027721464, 1986.

R. N°-8796 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399