Abstract
This paper proposes a formulation of the basic ideas of dynamic semantics in terms of the state monad. Such a monadic treatment allows to specify meanings as computations that clearly separate operations accessing and updating the context from purely truth conditional meaning composition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asher, N., Pogodalla, S.: A Montegovian treatment of modal subordination. In: Proceedings of Semantics and Linguistic Theory XX (2010)
Barker, C.: Continuations and the nature of quantification. Natural Language Semantics 10, 211–242 (2002)
Bekki, D.: Monads and Meta-lambda Calculus. In: Hattori, H., Kawamura, T., Idé, T., Yokoo, M., Murakami, Y. (eds.) JSAI 2008. LNCS (LNAI), vol. 5447, pp. 193–208. Springer, Heidelberg (2009)
de Groote, P.: Towards a Montegovian account of dynamics. In: Proceedings of Semantics and Linguistic Theory XVI (2006)
de Groote, P., Lebedeva, E.: Presupposition accommodation as exception handling. In: Proceedings of the 11th Annual Meeting of the Special Interest Group on Discourse and Dialogue, SIGDIAL 2010, pp. 71–74 (2010)
Groenendijk, J., Stokhof, M.: Dynamic Predicate Logic. Linguistics and Philosophy 14(1), 39–100 (1991)
Heim, I.: The Semantics of Definite and Indefinite Noun Phrases. PhD thesis, University of Massachusetts, Amherst (1982)
Lewis, D.: Adverbs of quantification. In: Keenan, E. (ed.) Formal Semantics of Natural Language, pp. 3–15. Cambridge University Press (1975)
Moggi, E.: Computational lambda-calculus and monads. In: Symposium on Logic in Computer Science, Asilomar, California. IEEE (June 1989)
Ogata, N.: Towards computational non-associative lambek lambda-calculi for formal pragmatics. In: Proceedings of the Fifth International Workshop on Logic and Engineering of Natural Language Semantics (LENLS 2008) in Conjunction with the 22nd Annual Conference of the Japanese Society for Artificial Intelligence 2008, pp. 79–102 (2008)
Pagin, P., Westerståhl, D.: Predicate logic with flexibly binding operators and natural language semantics. Journal of Logic, Language and Information 2(2), 89–128 (1993)
Shan, C.-C.: Monads for natural language semantics. In: Striegnitz, K. (ed.) Proceedings of the 2001 European Summer School in Logic, Language and Information Student Session, pp. 285–298 (2002)
Wadler, P.: Comprehending monads. Mathematical Structures in Computer Science 2(4), 461–493 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Unger, C. (2012). Dynamic Semantics as Monadic Computation. In: Okumura, M., Bekki, D., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2011. Lecture Notes in Computer Science(), vol 7258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32090-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32090-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32089-7
Online ISBN: 978-3-642-32090-3
eBook Packages: Computer ScienceComputer Science (R0)