P. Bédaride and C. Gardent, Semantic Normalisation : a Framework and an Experiment, 8th International Conference on Computational Semantics-IWCS 2009, 2009.

B. Bohnet and L. Wanner, On using a parallel graph rewriting formalism in generation, EWNLG '01: Proceedings of the 8th European workshop on Natural Language Generation, pp.1-11, 2001.
DOI : 10.3115/1117840.1117847

URL : http://dl.acm.org/ft_gateway.cfm?id=1117847&type=pdf

G. Bonfante, B. Guillaume, M. Morey, and G. Perrier, Modular graph rewriting to compute semantics, IWCS 2011, pp.65-74, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00579244

F. Chaumartin, S. Kahane, C. Montreal, and A. Copestake, Une approche paresseuse de l'analyse sémantique ou comment construire une interface syntaxe-sémantiquè a partir d'exemples, Proceedings of the 12th Conference of the European Chapter of the ACL (EACL 2009), pp.1-9, 2005.

P. Groote, Towards Abstract Categorial Grammars, 39th Annual Meeting of the Association for Computational Linguistics and 10th Conference of the European Chapter of the Association for Computational Linguistics, pp.148-155, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100529

R. Echahed, Inductively sequential term-graph rewrite systems, Proceedings of the 4th international conference on Graph Transformations, ICGT '08, pp.84-98, 2008.
DOI : 10.1007/978-3-540-87405-8_7

E. Godard, Y. Métivier, M. Mosbah, and A. Sellami, Termination detection of distributed algorithms by graph relabelling systems, Lecture Notes in Computer Science, vol.2505, pp.106-119, 2002.
DOI : 10.1007/3-540-45832-8_10

B. Guillaume and G. Perrier, Annotation sémantique du French TreebankàTreebank`Treebankà l'aide de la réécriture modulaire de graphes, Traitement Automatique des Langues Naturelles (TALN), 2012.

M. Hofmann, Linear types and non-size-increasing polynomial time computation, Information and Computation, pp.464-473, 1998.
DOI : 10.1016/s0890-5401(03)00009-9

URL : https://doi.org/10.1016/s0890-5401(03)00009-9

E. Hyvönen, Semantic Parsing as Graph Language Transformation-a Multidimensional Approach to Parsing Highly Inflectional Languages, COLING, pp.517-520, 1984.

D. Janssens and G. Rozenberg, Graph grammars with neighbourhood-controlled embedding, Theoretical Computer Science, vol.21, issue.1, pp.55-74, 1982.
DOI : 10.1016/0304-3975(82)90088-3

URL : https://doi.org/10.1016/0304-3975(82)90088-3

V. Jijkoun and M. De-rijke, Learning to transform linguistic graphs, Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing, 2007.

N. D. Jones, Computability and complexity: from a programming perspective, 1997.
DOI : 10.1007/978-94-010-0413-8_4

R. M. Kaplan and J. Bresnan, Lexical-functional grammar: A formal system for grammatical representation, pp.173-281, 1982.

D. Knuth and P. Bendix, editor, Computational problems in abstract algebra, 1970.

R. Montague, Universal grammar, Theoria, vol.36, issue.3, pp.373-398, 1970.

R. Montague, The proper treatment of quantification in ordinary english. Formal Semantics, pp.221-242, 1973.

M. Newman, On theories with a combinatorial definition of "equivalence, Annals of Math, vol.43, issue.2, pp.223-243, 1942.

D. Plump, On termination of graph rewriting, Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG '95, pp.88-100, 1995.
DOI : 10.1007/3-540-60618-1_68

D. Plump, Termination of graph rewriting is undecidable, Fundamenta Informaticae, vol.33, issue.2, pp.201-209, 1998.

C. Pollard and I. A. Sag, Head-Driven Phrase Structure Grammar, 1994.

E. Roche and Y. Schabes, Finite-State Language Processing, 1997.

G. Rozenberg, Handbook of Graph Grammars and Computing by, Foundations. World Scientific, vol.1, 1997.

A. Schürr, Programmed graph replacement systems, Handbook on Graph Grammars: Foundations, pp.479-546, 1997.

E. Stabler, Eléments de syntaxe structurale, Logical Aspects of Computational Linguistics, LACL'96, vol.1328, pp.68-95, 1959.

H. Uchida, M. Zhu, T. Senta, and U. Foundation, UNL: Universal Networking Language. UNDL Foundation, 2006.

K. Van-den-eynde and P. Mertens, La valence : l'approche pronominale et son application au lexique verbal, French Language Studies, vol.13, pp.63-104, 2003.

K. Vijay-shanker and A. K. Joshi, Feature structures based tree adjoining grammars, COLING, pp.714-719, 1988.
DOI : 10.3115/991719.991783

URL : http://dl.acm.org/ft_gateway.cfm?id=991783&type=pdf