Dependent Event Types. / Luo, Zhaohui; Soloviev, Sergei .

Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings. Springer, 2017. p. 216-228 (Lecture Notes in Computer Science; Vol. 10388).

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

Published

Standard

Dependent Event Types. / Luo, Zhaohui; Soloviev, Sergei .

Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings. Springer, 2017. p. 216-228 (Lecture Notes in Computer Science; Vol. 10388).

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

Harvard

Luo, Z & Soloviev, S 2017, Dependent Event Types. in Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10388, Springer, pp. 216-228. https://doi.org/10.1007/978-3-662-55386-2_15

APA

Luo, Z., & Soloviev, S. (2017). Dependent Event Types. In Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings (pp. 216-228). (Lecture Notes in Computer Science; Vol. 10388). Springer. https://doi.org/10.1007/978-3-662-55386-2_15

Vancouver

Luo Z, Soloviev S. Dependent Event Types. In Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings. Springer. 2017. p. 216-228. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-662-55386-2_15

Author

Luo, Zhaohui ; Soloviev, Sergei . / Dependent Event Types. Logic, Language, Information, and Computation: 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings. Springer, 2017. pp. 216-228 (Lecture Notes in Computer Science).

BibTeX

@inbook{1e7ad7cc865143bf9c1bbeed80c57ce6,
title = "Dependent Event Types",
abstract = "This paper studies how dependent types can be employed for a refined treatment of event types, offering a nice improvement to Davidson{\textquoteright}s event semantics. We consider dependent event types indexed by thematic roles and illustrate how, in the presence of refined event types, subtyping plays an essential role in semantic interpretations. We consider two extensions with dependent event types: first, the extension of Church{\textquoteright}s simple type theory as employed in Montague semantics that is familiar with many linguistic semanticists and, secondly, the extension of a modern type theory as employed in MTT-semantics. The former uses subsumptive subtyping, while the latter uses coercive subtyping, to capture the subtyping relationships between dependent event types. Both of these extensions have nice meta-theoretic properties such as normalisation and logical consistency; in particular, we shall show that the former can be faithfully embedded into the latter and hence has expected meta-theoretic properties. As an example of applications, it is shown that dependent event types give a natural solution to the incompatibility problem (sometimes called the event quantification problem) in combining event semantics with the traditional compositional semantics, both in the Montagovian setting with the simple type theory and in the setting of MTT-semantics.",
author = "Zhaohui Luo and Sergei Soloviev",
year = "2017",
doi = "10.1007/978-3-662-55386-2_15",
language = "English",
isbn = "978-3-662-55385-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "216--228",
booktitle = "Logic, Language, Information, and Computation",

}

RIS

TY - CHAP

T1 - Dependent Event Types

AU - Luo, Zhaohui

AU - Soloviev, Sergei

PY - 2017

Y1 - 2017

N2 - This paper studies how dependent types can be employed for a refined treatment of event types, offering a nice improvement to Davidson’s event semantics. We consider dependent event types indexed by thematic roles and illustrate how, in the presence of refined event types, subtyping plays an essential role in semantic interpretations. We consider two extensions with dependent event types: first, the extension of Church’s simple type theory as employed in Montague semantics that is familiar with many linguistic semanticists and, secondly, the extension of a modern type theory as employed in MTT-semantics. The former uses subsumptive subtyping, while the latter uses coercive subtyping, to capture the subtyping relationships between dependent event types. Both of these extensions have nice meta-theoretic properties such as normalisation and logical consistency; in particular, we shall show that the former can be faithfully embedded into the latter and hence has expected meta-theoretic properties. As an example of applications, it is shown that dependent event types give a natural solution to the incompatibility problem (sometimes called the event quantification problem) in combining event semantics with the traditional compositional semantics, both in the Montagovian setting with the simple type theory and in the setting of MTT-semantics.

AB - This paper studies how dependent types can be employed for a refined treatment of event types, offering a nice improvement to Davidson’s event semantics. We consider dependent event types indexed by thematic roles and illustrate how, in the presence of refined event types, subtyping plays an essential role in semantic interpretations. We consider two extensions with dependent event types: first, the extension of Church’s simple type theory as employed in Montague semantics that is familiar with many linguistic semanticists and, secondly, the extension of a modern type theory as employed in MTT-semantics. The former uses subsumptive subtyping, while the latter uses coercive subtyping, to capture the subtyping relationships between dependent event types. Both of these extensions have nice meta-theoretic properties such as normalisation and logical consistency; in particular, we shall show that the former can be faithfully embedded into the latter and hence has expected meta-theoretic properties. As an example of applications, it is shown that dependent event types give a natural solution to the incompatibility problem (sometimes called the event quantification problem) in combining event semantics with the traditional compositional semantics, both in the Montagovian setting with the simple type theory and in the setting of MTT-semantics.

U2 - 10.1007/978-3-662-55386-2_15

DO - 10.1007/978-3-662-55386-2_15

M3 - Chapter (peer-reviewed)

SN - 978-3-662-55385-5

T3 - Lecture Notes in Computer Science

SP - 216

EP - 228

BT - Logic, Language, Information, and Computation

PB - Springer

ER -