S. Chatzikyriakidis, M. Lafourcade, L. Ramadier, and M. Zarrouk, Type theories and lexical networks: Using serious games as the basis for multi-sorted typed systems, ESSLLI: European Summer School in Logic, Language and Information, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01216589

S. Chatzikyriakidis, F. Pasquali, and C. Retoré, From logical and linguistic generics to hilberts tau and epsilon quantifiers, IfCoLog Journal of Logics and their Applications, vol.4, issue.2, pp.231-255, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01803717

R. Cooper, Quantification and syntactic theory, reidel, dordrecht. CooperQuantification and Syntactic, 1983.

A. Copestake, D. Flickinger, C. Pollard, and I. A. Sag, Minimal recursion semantics: An introduction, Research on Language and Computation, vol.3, issue.2-3, pp.281-332, 2005.

V. Durand-guerrier, Négation et quantification dans la classe de mathématiques, 2016.

D. Hilbert, Die logischen grundlagen der mathematik, Mathematische Annalen, vol.88, issue.1, pp.151-165, 1922.

J. R. Hobbs and S. M. Shieber, An algorithm for generating quantifier scopings, Computational Linguistics, vol.13, issue.1-2, pp.47-63, 1987.

R. Huddleston and G. K. Pullum, The cambridge grammar of english, pp.1-23, 2002.

M. Johnson, Proof nets and the complexity of processing center embedded constructions, Journal of Logic, Language and Information, vol.7, issue.4, pp.433-447, 1998.

W. R. Keller, Nested cooper storage: The proper treatment of quantification in ordinary noun phrases, Natural language parsing and linguistic theories, pp.432-447, 1988.

M. Lafourcade, Making people play for Lexical Acquisition with the JeuxDeMots prototype, 7th International Symposium on Natural Language Processing (SNLP'07), 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00200883

J. Lambek, The mathematics of sentence structure, The American Mathematical Monthly, vol.65, issue.3, pp.154-170, 1958.

H. Leiß, On equality of contexts and completeness of the indexed epsilon-calculus, IfCoLog Journal of Logics and their Applications, vol.4, issue.2, pp.347-366, 2017.

R. Moot, Wide-coverage semantics for spatio-temporal reasoning, Traitement Automatique des Languages, vol.53, issue.2, pp.115-142, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00759928

R. Moot, The Grail theorem prover: Type theory for syntax and semantics, Modern Perspectives in Type Theoretical Semantics, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01471644

R. Moot and C. Retoré, The logic of categorial grammars: a deductive account of natural language syntax and semantics, vol.6850, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00829051

G. Morrill, Incremental processing and acceptability, Computational linguistics, vol.26, issue.3, pp.319-338, 2000.

K. Nagao, A preferential constraint satisfaction technique for natural language analysis, IEICE TRANSACTIONS on Information and Systems, vol.77, issue.2, pp.161-170, 1994.

C. Retoré, The montagovian generative lexicon lambda tyn: a type theoretical framework for natural language semantics, 19th international conference on types for proofs and programs (TYPES 2013, vol.26, pp.202-229, 2014.

M. Steedman, Alternating quantifier scope in ccg, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, pp.301-308, 1999.

M. Steedman, Taking scope: The natural semantics of quantifiers, 2012.