Articles

• Reducing Pronoun Accessibility to Presupposition Satisfaction (2024)
  (in print at the Journal of Semantics)
  
• Janus Sentences : a Puzzle for Theories of Local Implicatures (2024, with P. Schlenker)
  (accepted with minor revisions at the Journal of Semantics)
  
• Gricean equilibria in a general signaling game (2024)
  (under review at Games, Decision and Language, special edition of the International Journal of Game Theory)
  
• Local Pragmatics Redux (2024, with P. Schlenker)
  (under review at Linguistics and Philosophy)
  
• On the Syntactic Reality of Pragmatic Operators: the Case of Non-Redundancy (2024, with P. Schlenker)
  (under review at Rivista di Grammatica Generativa, festschrift for Carlo Cechetto)
  
• Existential and universal readings of pronouns across binary connectives: an experimental investigation (2024, with B. Spector and N. Gregorio)
  (under review at Semantics and Pragmatics)
  
• A split in mandatory embedded implicatures (2024)
  (under review at Snippets)
  
• Cumulativity from the perspective of Homogeneity (2021)
  (ms.)
  
• Articulated Cumulativity (2020)
  (published at Journal of Semantics)
  

Conference Proceedings

• Reciprocating same (2019)
  (Proceeding of SuB 24)
  
• Wide-scope distributivity (2019)
  (Proceeding of NELS 49)
  
• Gaps in the interpretation of pronouns (2018)
  (Proceeding of SALT 28)
  

Dissertation

• Cumulativity from Homogeneity
  (Committee: Martin Hackl, Roger Schwarzschild, Danny Fox, Gennaro Chierchia)

Conference Presentations

• Readings of pronouns across connectives are sensitive to monotony (2024) (with B. Spector)
  (Presented at Sinn und Bedeutung 29 @ C.U.M.O.)
  
• Cumulative readings of every: weak and asymmetric (2020)
  (Presented remotely at SALT 30 @ Cornell University)
  
• Reciprocating same (2019)
  (Presented at Sinn und Bedeutung 24 @ Osnabrück University)
  
• Reducing order-insensitivity in anaphora to accommodation (2019)
  (Presented at Workshop on Asymmetries in Language: Presuppositions and Beyond @ ZAS Berlin)
  
• Wide-scope distributivity (2019)
  (Presented at NELS 49)
  
• Gaps in the interpretation of pronouns (2018)
  (Presented at SALT 28)
  

Miscellanea

• Exh for Python
  

  This Python library can compute the exhaustified meaning of a formula. It computes maximal consistent sets, innocently excludable alternatives, innocently includable alternatives. It can deal with recursive Exhaustified formula and replicates Fox (2007)'s Free Choice account. Install with "pip install exh".

• Context-free languages: a constructive characterization (2020)
  

  In this note, I propose to characterize a constructive characterization of the class of context-free languages. The goal is to have a characterization similar to the characterization of the class of rational languages, as the smallest class of languages closed under some natural operations. The operations proposed are union, concatenation and λ-abstraction and fixed-point. This allows to expand the notion of context-free languages to arbitrary monoids and other weaker structures (e.g. trees). The proposal is illustrated with some Haskell code.

• Universal languages (2017)
  

  This is an attempt to elucidate the difference between two different views on the nature of UG: one view according to which UG specifies a class of languages ; one view according to which UG specifies a singe formal language and different mappings to the interface produce different languages. I show that the latter take is only compatible with certain classes of formal languages, such as the class of context-free languages, while certain others, such as the class of mildly context-sensitive languages aren't.

• Shajara (Web Edition, beta)
  

  Left-click to create nodes, Ctrl-Left-Click to add labels, Right-Click to delete nodes. Exports to QTree format, which can be immediately added to your TeX File.

• Shajara
  

  Left-click to create nodes, Ctrl-Left-Click to add labels, Right-Click to delete nodes. Exports to QTree format, which can be immediately added to your TeX File.

• Local contexts and anaphora (2018)
  (Presented at LINGUAE seminar at ENS)
  
• The referentiality of generic indefinites: evidence from anaphora (2017)
  (Presented at SNEWS)
  

• Referential antecedents in DS: simple, functional, paycheck and otherwise (2019)
  (Paper version of the talk at Workshop on Asymmetries in Language: Presuppositions and Beyond)
  
• A note on the relationship between maximal informativity and exhaustivity (2019)
  (incomplete draft)
  
• What is wrong with doubles? (2019)
  (Presented at MIT's LF reading group)
  
• Accounting for the existential/universal construals (2017)
  (Presented in class)
  
• Local contexts and anaphora (2017)
  (Presented at MIT's LF reading group)
  
• Relative clauses; interactions with modals and definite article choice in Fering and Akan (2017)
  (LF reading group presentation)
• A mixed approach to the semantics of "different" (2015)
  (Semantics 1st year squib)

  In this squib, I argue that Charnavel (2015)'s uniform approach to the meanings of "different" can successfully be turned into a movement analysis, where "different" is a scopal element (as in Barker 2007). This move is shown to be crucial if we want to account for readings of "different" under modal predicates. The scopal analysis of "different" also suggests that internal adjectives fall into one of two categories: scopal internal adjectives (like "different") and inert internal adjectives (like "neighboring"). Empirical tests can successfully distinguish the two categories.

• Compositionality can solve Carnap's problem for natural languages (2015)
  (CogMaster's mini-stage)

  Carnap has shown that one cannot retrieve the reference of logical terms from the patterns of inference they give rise to. Translated to natural languages, this means that functional elements (like every, and) cannot be acquired solely on the basis of entailments between sentences. Bonnay proved that Carnap's problem vanishes if we take compositionality to be a semantic universal (with some other minor assumptions). In this paper, I show that this result extends to the kind of trivalent first-order logic that is suited to deal with presuppositions.