M. =. By-compositionality-of-denotations and M. =. , Since ? ; preserves denotations, then Because of M ; N ? ; M , we know that for every e, M (e) is ?-less and therefore so is C[R ? ](e) Since C[R ? ](e) is ?-less for all e

@. , M. =. We-will-choose-d, and =. , We immediately have b = N ? = ; N = d. By the same argument is in the previous case For M ; N to have reduced to N , M (e) must have not been ?-less for any e, the same being the case for C, Because C[R ? ](e) is not ?-less for any e, we have c = C[R ? ]; N ? ; N = d

. Mtl, Monad classes, using functional dependencies, pp.2016-2023

H. Abelson, G. J. Sussman, and J. Sussman, Structure and interpretation of computer programs, 1996.

S. Anderbois, A. Brasoveanu, and R. Henderson, Crossing the appositive / at-issue meaning boundary, Semantics and Linguistic Theory, pp.328-346, 2010.
DOI : 10.3765/salt.v20i0.2551

S. Andjelkovic, Towards indexed algebraic effects and handlers. The 3rd ACM SIGPLAN Workshop on Higher-Order Programming with Effects, 2014.

C. Appel, J. G. Van-oostrom, and . Simonsen, Higher-order (non-) modularity. Logic Group Preprint Series, pp.1-26, 2010.

N. Asher and A. Lascarides, Logics of conversation, 2003.

V. Balat, R. D. Cosmo, and M. Fiore, Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, ACM SIGPLAN Notices, vol.39, issue.1, pp.64-76, 2004.
DOI : 10.1145/982962.964007

URL : https://hal.archives-ouvertes.fr/hal-00149561

H. P. Barendregt, The lambda calculus: its syntax and semantics. Studies in logic and the foundations of mathematics, 1984.

C. Barker, Continuations in natural language, 2006.
DOI : 10.1093/acprof:oso/9780199575015.001.0001

C. Barker, Continuations and the nature of quantification. Natural language semantics, pp.211-242, 2002.

C. Barker and D. Bumford, Monads for natural language, 2015.

C. Barker and C. Shan, Continuations and natural language
DOI : 10.1093/acprof:oso/9780199575015.001.0001

A. Bauer, Lambda the ultimate ? programming with algebraic effects and handlers, 2012.
DOI : 10.1016/j.jlamp.2014.02.001

URL : http://arxiv.org/pdf/1203.1539

A. Bauer and M. Pretnar, Programming with algebraic effects and handlers, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.1, pp.108-123, 2015.
DOI : 10.1016/j.jlamp.2014.02.001

URL : http://arxiv.org/pdf/1203.1539

I. David, B. Beaver, and . Geurts, Presupposition The Stanford Encyclopedia of Philosophy, 2014.

G. Ben-avi and Y. Winter, The semantics of intensionalization. ESSLLI, pp.98-246, 2007.

F. Blanqui, Termination and Confluence of Higher-Order Rewrite Systems, Rewriting Techniques and Applications, pp.47-61, 2000.
DOI : 10.1007/10721975_4

URL : https://hal.archives-ouvertes.fr/inria-00105556

F. Blanqui, J. Jouannaud, and M. Okada, Inductive-data-type systems, Theoretical Computer Science, vol.272, issue.1-2, pp.41-68, 2002.
DOI : 10.1016/S0304-3975(00)00347-9

URL : https://hal.archives-ouvertes.fr/inria-00105578

C. Blom, P. De-groote, Y. Winter, and J. Zwarts, Implicit arguments: event modification or option type categories? In Logic, Language and Meaning, pp.240-250, 2012.
DOI : 10.1007/978-3-642-31482-7_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.9065

E. Brady, Programming and reasoning with algebraic effects and dependent types, Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, pp.133-144, 2013.
DOI : 10.1145/2500365.2500581

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.1364

R. Cartwright and M. Felleisen, Extensible denotational language specifications, Theoretical Aspects of Computer Software, pp.244-272, 1994.
DOI : 10.1007/3-540-57887-0_99

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.5941

L. Champollion, Back to events: More on the logic of verbal modification. University of Pennsylvania Working Papers in Linguistics, p.7, 2015.

L. Champollion, The interaction of compositional semantics and event semantics, Linguistics and Philosophy, vol.24, issue.2, pp.31-66, 2015.
DOI : 10.1023/A:1005690022190

S. Charlow, On the semantics of exceptional scope, 2014.

S. Charlow, Conventional implicature as a scope phenomenon. Workshop on continuations and scope, 2015.

S. Charlow, The grammar of exceptional scope. Colloquium, 2015.

S. Charlow, Monadic dynamic semantics for anaphora Invited talk, Dynamic Semantics: Modern type theoretic and category theoretic approaches, 2015.

S. Charlow, Monads, applicative functors, and scope. ESSLLI 2015 ? Monads for Natural Language, 2015.

O. Danvy and A. Filinski, A functional abstraction of typed contexts, Univ, 1989.

N. Govert-de-bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem, Indagationes Mathematicae (Proceedings), volume, pp.381-392, 1972.

P. De and G. , Towards abstract categorial grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, pp.252-259, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100529

P. De and G. , Type raising, continuations, and classical logic, Proceedings of the thirteenth Amsterdam Colloquium, 2001.

P. De and G. , Tree-adjoining grammars as abstract categorial grammars, TAG+6, Proceedings of the sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, pp.145-150, 2002.

P. De and G. , Towards a montagovian account of dynamics, Proceedings of SALT, 2006.

P. De, G. , and M. Kanazawa, A note on intensionalization, Journal of Logic, Language and Information, vol.22, issue.2, pp.173-194, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909207

S. Dolan, L. White, J. Sivaramakrishnan, A. Yallop, and . Madhavapeddy, Effective concurrency through algebraic effects, OCaml Users and Developers Workshop, 2015.

M. Felleisen, R. B. Findler, and M. Flatt, Semantics engineering with PLT Redex, 2009.

M. Felleisen, M. Wand, D. Friedman, and B. Duba, Abstract continuations: a mathematical semantics for handling full jumps, Proceedings of the 1988 ACM conference on LISP and functional programming , LFP '88, pp.52-62, 1988.
DOI : 10.1145/62678.62684

A. Filinski, Representing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.446-457, 1994.
DOI : 10.1145/174675.178047

P. Marcelo, G. Fiore, D. Plotkin, and . Turi, Abstract syntax and variable binding, 2003.

B. Geurts and E. Maier, Quotation in context, Belgian Journal of Linguistics, vol.17, issue.1, pp.109-128, 2003.

G. Giorgolo and A. Asudeh, Monads for conventional implicatures, Proceedings of sinn und bedeutung, pp.265-278, 2012.

G. Giorgolo and A. Asudeh, Monads as a Solution for Generalized Opacity, Proceedings of the EACL 2014 Workshop on Type Theory and Natural Language Semantics (TTNLS), p.19, 2014.
DOI : 10.3115/v1/W14-1403

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.672.1665

G. Giorgolo and A. Asudeh, Natural language semantics with enriched meanings, 2015.

G. Giorgolo, A. Asudeh, M. Butt, and T. King, Multidimensional semantics with unidimensional glue logic, Proceedings of LFG11, pp.236-256, 2011.

G. Giorgolo and C. Unger, Coreference without discourse referents: a nonrepresentational drt-like discourse semantics, LOT Occasional Series, vol.14, pp.69-81, 2009.

J. Groenendijk and M. Stokhof, Dynamic predicate logic, Linguistics and Philosophy, vol.12, issue.1, pp.39-100, 1991.
DOI : 10.1007/BF00628304

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2292

D. Gutzmann, Use-conditional meaning: Studies in multidimensional semantics, OUP Oxford, 2015.
DOI : 10.1093/acprof:oso/9780198723820.001.0001

M. Hamana, Higher-order semantic labelling for inductive datatype systems, Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, PPDP '07, pp.97-108, 2007.
DOI : 10.1145/1273920.1273933

D. Hillerström, S. Lindley, and K. Sivaramakrishnan, Compiling links effect handlers to the ocaml backend, ML Workshop, 2016.

J. R. Hobbs and S. J. Rosenschein, Making computational sense of Montague's intensional logic, Artificial Intelligence, vol.9, issue.3, pp.287-306, 1977.
DOI : 10.1016/0004-3702(77)90025-X

W. Hodges, Tarski's truth definitions The Stanford Encyclopedia of Philosophy, 2014.

J. Hughes, Generalising monads to arrows, Science of Computer Programming, vol.37, issue.1-3, pp.67-111, 2000.
DOI : 10.1016/S0167-6423(99)00023-4

URL : http://doi.org/10.1016/s0167-6423(99)00023-4

M. Hyland, G. Plotkin, and J. Power, Combining effects: Sum and tensor, Theoretical Computer Science, vol.357, issue.1-3, pp.70-99, 2006.
DOI : 10.1016/j.tcs.2006.03.013

URL : http://doi.org/10.1016/j.tcs.2006.03.013

P. Mark and . Jones, Functional programming with overloading and higher-order polymorphism, International School on Advanced Functional Programming, pp.97-136, 1995.

P. Simon and . Jones, Haskell 98 language and libraries: the revised report, 2003.

O. Kammar, S. Lindley, and N. Oury, Handlers in action, Proceedings of the 18th ACM SIGPLAN international conference on Functional programming, pp.145-158, 2013.
DOI : 10.1145/2500365.2500590

H. Kamp and U. Reyle, From discourse to logic: Introduction to modeltheoretic semantics of natural language, formal logic and discourse representation theory. Number 42, 1993.

M. Kanazawa, Parsing and generation as datalog queries, Annual Meeting-Association for Computational Linguistics, p.176, 2007.

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

O. Kiselyov, Call-by-name linguistic side effects, ESSLLI 2008 Workshop on Symmetric calculi and Ludics for the semantic interpretation, 2008.

O. Kiselyov, Applicative abstract categorial grammars, Proceedings of the Third Workshop on Natural Language and Computer Science, 2015.
DOI : 10.1007/978-3-319-50953-2_6

O. Kiselyov, Applicative Abstract Categorial Grammars in Full Swing, Proceedings of the Twelth Workshop on Logic and Engineering of Natural Language Semantics, 2015.
DOI : 10.1007/978-3-319-50953-2_6

O. Kiselyov and H. Ishii, Freer monads, more extensible effects, ACM SIGPLAN Notices, pp.94-105, 2015.
DOI : 10.1145/2887747.2804319

O. Kiselyov, A. Sabry, and C. Swords, Extensible effects, Proceedings of the 2013 ACM SIGPLAN symposium on Haskell, Haskell '13, pp.59-70, 2013.
DOI : 10.1145/2503778.2503791

O. Kiselyov and C. Shan, Lambda: the ultimate syntax-semantics interface, 2010.

O. Kiselyov and K. Sivaramakrishnan, Eff directly in ocaml, ML Workshop, 2016.

. Stephen-cole-kleene, Introduction to metamathematics, 1952.

J. W. Klop, Term rewriting systems. Handbook of logic in computer science, pp.1-116, 1992.

J. W. Klop, V. Van-oostrom, and F. Van-raamsdonk, Combinatory reduction systems: introduction and survey. Theoretical computer science, pp.279-308, 1993.
DOI : 10.1016/0304-3975(93)90091-7

URL : http://doi.org/10.1016/0304-3975(93)90091-7

B. Knaster and A. Tarski, Un théoreme sur les fonctions d'ensembles, Ann. Soc. Polon. Math, vol.6, issue.133, p.2013134, 1928.

E. Krahmer and R. Muskens, Negation and Disjunction in Discourse Representation Theory, Journal of Semantics, vol.12, issue.4, pp.357-376, 1995.
DOI : 10.1093/jos/12.4.357

S. Kuschert and . Kohlhase, A type-theoretic semantics for lambda-drt, Proceedings of the Tenth Amsterdam Colloquium, 1995.

E. Lebedeva, Expression de la dynamique du discours à l'aide de continuations, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00783245

C. Stephen, . Levinson, and . Deixis, In The handbook of pragmatics, pp.97-121, 2004.

L. Paul-blain, A subsuming paradigm General semantics Monad transformers and modular interpreters, Typed Lambda Calculi and Applications Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.228-24318, 1970.

M. Lillibridge, Exceptions are strictly more powerful than call/cc, 1995.

S. Lindley, Algebraic effects and effect handlers for idioms and arrows, Proceedings of the 10th ACM SIGPLAN workshop on Generic programming, WGP '14, pp.47-58, 2014.
DOI : 10.1145/2633628.2633636

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8321

S. Lindley, C. Mcbride, and C. Mclaughlin, Do be do be do, 2016.
DOI : 10.1145/3009837.3009897

S. Mac and L. , Categories for the working mathematician, 1978.

J. Mar?ík and M. Amblard, Algebraic effects and handlers in natural language interpretation, Natural Language and Computer Science. Center for Informatics and Systems of the University of Coimbra, 2014.

S. Martin and C. Pollard, A Dynamic Categorial Grammar, International Conference on Formal Grammar, pp.138-154, 2014.
DOI : 10.1007/978-3-662-44121-3_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.638.6658

C. Mcbride and R. Paterson, Applicative programming with effects, Journal of Functional Programming, vol.18, issue.01, pp.1-13, 2008.
DOI : 10.1017/S0956796800003658

J. Mccarthy, A basis for a mathematical theory of computation, preliminary report In Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference, pp.225-238, 1961.

E. Meijer, M. Fokkinga, and R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, Functional Programming Languages and Computer Architecture, pp.124-144, 1991.
DOI : 10.1007/3540543961_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.125

E. Moggi, An abstract view of programming languages, 1990.

E. Moggi, Notions of computation and monads. Information and computation, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4

URL : http://doi.org/10.1016/0890-5401(91)90052-4

R. Montague, English as a formal language, Linguaggi nella societae nella tecnica, pp.189-224, 1970.

R. Montague, Universal grammar, Theoria, vol.26, issue.3, pp.373-398, 1970.
DOI : 10.5840/monist19695327

R. Montague, The proper treatment of quantification in ordinary english, 1973.

R. Muskens, Combining Montague semantics and discourse representation, Linguistics and Philosophy, vol.12, issue.2, pp.143-186, 1996.
DOI : 10.1007/978-94-011-1715-9

R. Muskens, Lambda grammars and the syntax-semantics interface, Proceedings of the Thirteenth Amsterdam Colloquium, pp.150-155, 2001.

R. Nouwen, A. Brasoveanu-van-eijck, and A. Visser, Dynamic semantics The Stanford Encyclopedia of Philosophy, 2016.

G. Nunberg, The linguistics of punctuation. Number 18. Center for the Study of Language (CSLI), 1990.

G. Plotkin and M. Pretnar, Handlers of Algebraic Effects, Programming Languages and Systems, pp.80-94, 2009.
DOI : 10.1007/978-3-642-00590-9_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.9808

D. Gordon, M. Plotkin, and . Pretnar, Handling algebraic effects. arXiv preprint, 2013.

S. Pogodalla, Generalizing a proof-theoretic account of scope ambiguity, 7th International Workshop on Computational Semantics, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00112898

S. Pogodalla and F. Pompigne, Controlling Extraction in Abstract Categorial Grammars, Formal Grammar, 2012.
DOI : 10.1007/978-3-642-32024-8_11

URL : https://hal.archives-ouvertes.fr/inria-00565629

C. Pollard, Convergent grammar, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00390490

C. Potts, The logic of conventional implicatures, 2005.

C. Potts, The dimensions of quotation. Direct compositionality, pp.405-431, 2007.

M. Pretnar, Logic and handling of algebraic effects, 2010.

S. Qian, Accessibility of Referents in Discourse Semantics, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01104091

C. Roberts, Modal subordination and pronominal anaphora in discourse, Linguistics and Philosophy, vol.7, issue.6, pp.683-721, 1989.
DOI : 10.1007/BF00632602

C. Shan, Monads for natural language semantics. arXiv preprint cs, 2002.

C. Shan, Delimited continuations in natural language: Quantification and polarity sensitivity . arXiv preprint cs/0404006, 2004.

C. Shan, Linguistic side effects, Proceedings of the Eighteenth Annual IEEE Symposium on Logic and Computer Science (LICS 2003) Workshop on Logic and Computational, pp.132-163, 2005.

C. Shan, Linguistic side effects, 2005.

C. Shan, Inverse Scope as Metalinguistic Quotation in Operational Semantics, Annual Conference of the Japanese Society for Artificial Intelligence, pp.123-134, 2007.
DOI : 10.1007/978-3-540-78197-4_13

C. Shan, A static simulation of dynamic delimited control. Higher-Order and Symbolic Computation, pp.371-401, 2007.

C. Shan, The character of quotation, Linguistics and Philosophy, vol.42, issue.5, pp.417-443, 2010.
DOI : 10.1016/j.pragma.2010.04.024

C. Shan and C. Barker, Explaining Crossover and Superiority as Left-to-right Evaluation, Linguistics and Philosophy, vol.2, issue.4, pp.91-134, 2006.
DOI : 10.1007/3-540-15648-8_17

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.734

D. Sitaram, Teach yourself scheme in fixnum days Voir http, 1998.

W. Swierstra, Data types ? la carte, Journal of Functional Programming, vol.18, issue.04, pp.423-436, 2008.
DOI : 10.1093/acprof:oso/9780198568612.001.0001

Z. Gendler-szabó and . Compositionality, The Stanford Encyclopedia of Philosophy, 2013.

W. William and . Tait, Intensional interpretations of functionals of finite type i. The journal of symbolic logic, pp.198-212, 1967.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

A. Tarski and R. Vaught, Arithmetical extensions of relational systems, pp.81-102, 1986.

C. Unger, Dynamic Semantics as Monadic Computation, JSAI International Symposium on Artificial Intelligence, pp.68-81, 2011.
DOI : 10.1007/978-3-642-32090-3_7

URL : https://pub.uni-bielefeld.de/download/2485053/2674843

C. Unger, Dynamic Semantics as Monadic Computation, Proceedings of the 8th International Workshop on Logic and Engineering of Natural Language Semantics, p.2012
DOI : 10.1007/978-3-642-32090-3_7

URL : https://pub.uni-bielefeld.de/download/2485053/2674843

A. Rob and . Van-der-sandt, Presupposition projection as anaphora resolution, Journal of semantics, vol.9, issue.4, pp.333-377, 1992.

J. Noortje, J. Venhuizen, H. Bos, and . Brouwer, Parsimonious semantic representations with projection pointers, Proceedings of the 10th International Conference on Computational Semantics (IWCS 2013)?Long Papers, pp.252-263, 2013.

P. Wadler, Recursive types for free, 1990.

P. Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.1-14, 1992.
DOI : 10.1145/143165.143169

N. Wu, Transformers, handlers in disguise Haskell eXchange 2015, recording at https: //skillsmatter.com/skillscasts/6733-transformers-handlers-in-disguise, 2015.

A. Appendix, List of Examples (24) (c 0 ) Maybe (c 1 ) Wilma thinks that (c 2 ) her husband is having an affair, p.181

. De-l-'épithète-expressif-idiot, En suivant la théorie des implicatures conventionnelles de Potts [108], élaborée par Gutzmann [54], on introduit une deuxième dimension du sens dans laquelle on va noter l'attitude négative de l'interlocuteur envers l'objet