| [1] |
Anne Bonfante and Jean-Yves Marion.
Les paradoxes de la défense virale : Le cas bradley.
In Misc, volume 28, pages 4-7, 2006. [ bib ] |
| [2] |
Guillaume Bonfante, Jean-Yves Marion, and Romain Péchoux.
A characterization of alternating log time by first order functional
programs.
In Springer, editor, LPAR, volume 4246 of Lecture Notes in
Computer Science, pages 90-104, 2006. [ bib | .pdf ] |
| [3] |
J-Y Marion and R. Péchoux.
Resource analysis by sup-interpretation.
In FLOPS, volume 3945 of Lecture Notes in Computer
Science, pages 163-176. Springer, 2006. [ bib | .pdf ] |
| [4] |
G. Bonfante, R. Kahle, J-Y Marion, and I. Oitavem.
Towards an implicit characterization of NC^k.
In Springer, editor, CSL, volume 4207 of Lecture Notes in
Computer Science, pages 212-224. Springer, 2006. [ bib | .pdf ] |
| [5] |
Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, and Alwen
Tiu.
Expressiveness + automation + soundness: Towards combining smt
solvers and interactive proof assistants.
In TACAS, volume 3920 of Lecture Notes in Computer
Science, pages 167-181, 2006. [ bib | .pdf ] |
| [6] |
O. Bournez, F. Cucker, P.J. de Naurois, and J.Y. Marion.
Implicit complexity over an arbitrary structure: Quantifier
alternations.
Information and Computation, 204(2):210-230, Feb 2006. [ bib | .pdf ] |
| [7] |
Jérôme Besombes and Jean-Yves Marion.
Learning tree languages from positive examples and membership
queries.
Theoretical Computer Science, 2006. [ bib | .pdf ] |
| [8] |
Guillaume Bonfante, Matthieu Kaczmarek, and Jean-Yves Marion.
On abstract computer virology: from a recursion-theoretic
perspective.
Journal of computer virology, 1(3-4), 2006. [ bib | .pdf ] |
| [9] |
Guillaume Bonfante, Matthieu Kaczmarek, and Jean-Yves Marion.
Toward an abstract computer virology.
In ICTAC, volume 3722 of Lecture Notes in Computer
Science, pages 579-593. Springer, Oct 2005. [ bib | .pdf ] |
| [10] |
Jérôme Besombes and Jean-Yves Marion.
Learning discrete categorial grammars from structures.
Technical report, loria, 2005.
submitted to Journal of Applied Logic. [ bib | .pdf ] |
| [11] |
Guillaume Bonfante, Jean-Yves Marion, and Jean-Yves Moyen.
Quasi-interpretations and small space bounds.
In Jürgen Giesl, editor, Term Rewriting and Applications,
16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005,
Proceedings, volume 3467 of Lecture Notes in Computer Science, pages
150-164. Springer, 2005. [ bib | .pdf ] |
| [12] |
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves
Marion.
Implicit complexity over an arbitrary structure: Sequential and
parallel polynomial time.
Journal of Logic and Computation, 15(1):41-58, 2005. [ bib | .pdf ] |
| [13] |
Jérôme Besombes and Jean-Yves Marion.
Learning reversible categorial grammars from structures.
In Mieczyslaw A. Klopotek, Slawomir T. Wierzchon, and Krzsztof
Trojanowski, editors, Intelligent Information Processing and Web Mining,
Proceedings of the International IIS: IIPWMO04, Advances in Soft
Computing, pages 181-190. Springer, May 2004. [ bib | .pdf ] |
| [14] |
Jérôme Besombes and Jean-Yves Marion.
Learning tree languages from positive examples and membership
queries.
In Shai Ben-David, John Case, and Akira Maruoka, editors, 15th
international conference on Algorithmic Learning Theory - ALT, volume 3244
of Lecture notes in Artificial Intelligence, pages 440-453. Springer,
Oct 2004. [ bib | .pdf ] |
| [15] |
Jérôme Besombes and Jean-Yves Marion.
Apprentissage des grammaires catégorielles à partir de
structures.
In Conférence Francophone d'Apprentissage - CAp'2004, pages
315-330. Presse universitaire de Grenoble, Jun 2004. [ bib | .pdf ] |
| [16] |
Jean-Yves Marion.
Editorial : Implicit computational complexity (ICC).
Theoretical Computer Science, 318(1-2):1, Jun 2004. [ bib ] |
| [17] |
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves
Marion.
Tailoring recursion to characterize non-deterministic complexity
classes over arbitrary structures.
In IFIP TCS, pages 409-422. Kluwer, 2004. [ bib | .pdf ] |
| [18] |
Jean-Yves Marion.
Analysing the implicit complexity of programs.
Information and Computation, 183(1):2-18, 2003. [ bib | .ps ] |
| [19] |
Jérôme Besombes and Jean-Yves Marion.
Apprentissage des langages réguliers d'arbres et applications.
Traitement automatique de langues, 44(1):121-153, Jul 2003. [ bib | .ps ] |
| [20] |
Jérôme Besombes and Jean-Yves Marion.
Apprentissage des langages réguliers d'arbres à l'aide d'un
expert.
In Conférence d'Apprentissage - CAP'2003, pages 107-122,
Jul 2003. [ bib | .pdf ] |
| [21] |
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves
Marion.
Safe recursion over an arbitrary structure: Par, ph and dph.
Electronic Notes in Theoretical Computer Science, 90(1), 2003. [ bib | .pdf ] |
| [22] |
Serge Grigorieff and Jean-Yves Marion.
Kolmogorov complexity and non-determinism.
Theor. Comput. Sci., 271(1-2):151-180, 2002. [ bib | .ps ] |
| [23] |
Jérôme Besombes and Jean-Yves Marion.
Apprentissage des langages réguliers d'arbres et applications.
In Conférence d'Apprentissage - CAP'2002, pages 55-70, Jul
2002. [ bib | .pdf ] |
| [24] |
G. Bonfante, A. Cichon, J.-Y. Marion, and H. Touzet.
Algorithms with polynomial interpretation termination proof.
Journal of Functional Programming, 11(1):33-53, 2001. [ bib | .ps ] |
| [25] |
G. Bonfante, J.-Y. Marion, and J.-Y. Moyen.
On lexicographic termination ordering with space bound
certifications.
In Dines Bjørner, Manfred Broy, and Alexandre V. Zamulin, editors,
Perspectives of System Informatics, 4th International Andrei Ershov
Memorial Conference, PSI 2001, Novosibirsk, Russia, volume 2244 of
Lecture Notes in Computer Science. Springer, Jul 2001. [ bib | .ps ] |
| [26] |
Jérôme Besombes and Jean-Yves Marion.
Identification reversible dependency tree languages.
In 3rd Learning Language in Logic (LLL) Workshop. L.
Popelinsky, Matthieu Nepil, Sep 2001. [ bib | .ps ] |
| [27] |
Jean-Yves Marion.
Actual arithmetic and feasibility.
In L. Fribourg, editor, International Workshop on Computer
Science Logic - CSL'2001, volume 2142 of Lecture notes in Computer
Science, pages 115-129. Springer, Sep 2001. [ bib | .ps ] |
| [28] |
D. Leivant and J.-Y. Marion.
A characterization of alternating log time by ramified recurrence.
Theoretical Computer Science, 236(1-2):192-208, Apr 2000. [ bib | .ps ] |
| [29] |
J.-Y. Marion and J.-Y. Moyen.
Efficient first order functional program interpreter with time bound
certifications.
In Michel Parigot and Andrei Voronkov, editors, Logic for
Programming and Automated Reasoning, 7th International Conference, LPAR 2000,
Reunion Island, France, volume 1955 of Lecture Notes in Computer
Science, pages 25-42. Springer, Nov 2000. [ bib | .ps ] |
| [30] |
J.-Y. Marion.
Complexité implicite des calculs, de la théorie à la
pratique.
Habilitation à diriger les recherches, Université Nancy 2,
2000. [ bib | .pdf ] |
| [31] |
J.-Y. Marion.
From multiple sequent for additive linear logic to decision
procedures for free lattices.
Theoretical Computer Science, 224(1-2):157-172, 1999. [ bib | .ps ] |
| [32] |
G. Bonfante, A. Cichon, J.-Y. Marion, and H. Touzet.
Complexity classes and rewrite systems with polynomial
interpretation.
In Computer Science Logic, 12th International Workshop, CSL'98,
volume 1584 of Lecture Notes in Computer Science, pages 372-384.
Springer, 1999. [ bib | .ps ] |
| [33] |
J.-Y. Marion.
Case study : Additive linear logic and lattices.
In S. Adian A. Nerode, editor, 4th International Symposium
Logical, Foundations of Computer Science, volume 1234 of Lecture Notes
in Computer Science, pages 237-247. Springer, July 1997. [ bib | .ps ] |
| [34] |
D. Leivant and J.-Y. Marion.
Predicative functional recurrence and poly-space.
In M. Bidoit and M. Dauchet, editors, TAPSOFT'97, Theory and
Practice of Software Development, volume 1214 of Lecture Notes in
Computer Science, pages 369-380. Springer, Apr 1997. [ bib | .ps ] |
| [35] |
J.-Y. Marion.
Additive linear logic with analytic cut.
IGPL, 4(3):48-51, May 1996.
Third Worshop on Logic, Language, Information and Computation.
R. de Queiroz. http://www.mpi-sb.mpg.de/igpl/Bulletin/V4-3/. [ bib ] |
| [36] |
D. Leivant and J.-Y. Marion.
Ramified recurrence and computational complexity II: substitution
and poly-space.
In L. Pacholski and J. Tiuryn, editors, Computer Science Logic,
8th Workshop, CSL '94, volume 933 of Lecture Notes in Computer
Science, pages 486-500, Kazimierz,Poland, 1994. Springer. [ bib | .ps ] |
| [37] |
D. Leivant and J.-Y. Marion.
Lambda calculus characterizations of poly-time.
Fundamenta Informaticae, 19(1,2):167,184, September 1993. [ bib ] |
| [38] |
D. Leivant and J.-Y. Marion.
A λ-calculus characterizations of poly-time.
In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and
Applications, volume 664 of Lecture Notes in Computer Science, pages
274-288. Springer, 1993. [ bib | .ps ] |
| [39] |
J.-Y. Marion.
Extension du système T de Gödel dans les domaines finis,
Etude de la complexité.
PhD thesis, Université Paris 7, December 1991.
140 pages. [ bib ] |
| [40] |
Guillaume Bonfante, Jean-Yves Marion, and Jean-Yves Moyen.
Quasi-interpretations, a way to control resources.
Theoretical Computer Science, (revision). [ bib | .pdf ] |
| [41] |
D. Leivant and J.-Y. Marion.
Predicative recurrence and computational complexity IV:
Predicative functionals and poly-space.
should be published ! [ bib ] |
This file has been generated by bibtex2html 1.80