{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:43:41Z","timestamp":1725795821134},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662437414"},{"type":"electronic","value":"9783662437421"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43742-1_11","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T21:23:10Z","timestamp":1403126590000},"page":"138-148","source":"Crossref","is-referenced-by-count":2,"title":["Monotonicity Reasoning in Formal Semantics Based on Modern Type Theories"],"prefix":"10.1007","author":[{"given":"Georgiana E.","family":"Lungu","sequence":"first","affiliation":[]},{"given":"Zhaohui","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00350139","volume":"4","author":"J. Barwise","year":"1981","unstructured":"Barwise, J., Cooper, R.: Generalized quantifiers and natural language. Linguistics and Philosophy\u00a04(2), 159\u2013219 (1981)","journal-title":"Linguistics and Philosophy"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1010648911114","volume":"27","author":"P. Callaghan","year":"2001","unstructured":"Callaghan, P., Luo, Z.: An implementation of LF with coercive subtyping and universes. Journal of Automated Reasoning\u00a027(1), 3\u201327 (2001)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-41578-4_3","volume-title":"Constraint Solving and Language Processing","author":"S. Chatzikyriakidis","year":"2013","unstructured":"Chatzikyriakidis, S., Luo, Z.: An account of natural language coordination in type theory with coercive subtyping. In: Duchier, D., Parmentier, Y. (eds.) CSLP 2012. LNCS, vol.\u00a08114, pp. 31\u201351. Springer, Heidelberg (2013)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-39998-5_10","volume-title":"Formal Grammar","author":"S. Chatzikyriakidis","year":"2013","unstructured":"Chatzikyriakidis, S., Luo, Z.: Adjectives in a modern type-theoretical setting. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012\/2013. LNCS, vol.\u00a08036, pp. 159\u2013174. Springer, Heidelberg (2013)"},{"key":"11_CR5","unstructured":"Chatzikyriakidis, S., Luo, Z.: Natural language inference in Coq. In: EACL Workshop on Type Theory and Natural Language Semantics, Goteborg (2013) (submitted manuscript)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Chatzikyriakidis, S., Luo, Z.: Natural language reasoning using proof assistant technology: Rich typing and beyond. In: EACL Workshop on Type Theory and Natural Language Semantics. Goteborg (2014)","DOI":"10.3115\/v1\/W14-1405"},{"key":"11_CR7","unstructured":"The Coq Development Team. The Coq Proof Assistant Reference Manual (Version 8.1), INRIA (2007)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Dowty, D.: The role of negative polarity and concord marking in natural language reasoning. In: Proc of the 4th SALT Conference (1994)","DOI":"10.3765\/salt.v4i0.2461"},{"key":"11_CR9","unstructured":"Huijben, R.: A Coq module for natural logic. Master\u2019s thesis, Technische Universiteit Eindhoven (2013)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198538356.001.0001"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1093\/logcom\/9.1.105","volume":"9","author":"Z. Luo","year":"1999","unstructured":"Luo, Z.: Coercive subtyping. Journal of Logic and Computation\u00a09(1), 105\u2013130 (1999)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Luo, Z.: Type-theoretical semantics with coercive subtyping. In: Semantics and Linguistic Theory 20 (SALT20), Vancouver (2010)","DOI":"10.3765\/salt.v20i0.2580"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-31262-5_12","volume-title":"Logical Aspects of Computational Linguistics","author":"Z. Luo","year":"2012","unstructured":"Luo, Z.: Common nouns as types. In: B\u00e9chet, D., Dikovsky, A. (eds.) LACL 2012. LNCS, vol.\u00a07351, pp. 173\u2013185. Springer, Heidelberg (2012)"},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10988-013-9126-4","volume":"35","author":"Z. Luo","year":"2012","unstructured":"Luo, Z.: Formal semantics in modern type theories with coercive subtyping. Linguistics and Philosophy\u00a035(6), 491\u2013513 (2012)","journal-title":"Linguistics and Philosophy"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Luo, Z., Adams, R.: Structural subtyping for inductive types with functorial equality rules. Mathematical Structures in Computer Science\u00a018(5) (2008)","DOI":"10.1017\/S0960129508006956"},{"key":"11_CR16","unstructured":"Luo, Z., Pollack, R.: LEGO Proof Development System: User\u2019s Manual. LFCS Report ECS-LFCS-92-211, Dept of Computer Science, Univ. of Edinburgh (1992)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Luo, Z., Soloviev, S., Xue, T.: Coercive subtyping: theory and implementation. Information and Computation 223 (2012)","DOI":"10.1016\/j.ic.2012.10.020"},{"key":"11_CR18","unstructured":"MacCartney, B.: Natural Language Inference. PhD thesis, Stanford Universisty (2009)"},{"key":"11_CR19","unstructured":"The Matita proof assistant (2008), http:\/\/matita.cs.unibo.it\/?"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Purdy, W.C.: A logic for natural language. Notre Dame Journal of Formal Logic\u00a032 (1991)","DOI":"10.1305\/ndjfl\/1093635837"},{"key":"11_CR21","unstructured":"Quine, W.: Word & Object. MIT Press (1960)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Ranta, A.: Type-Theoretical Grammar. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198538578.001.0001"},{"key":"11_CR23","unstructured":"Sommers, F.: The Logic of Natural Language. Cambridge Univ. Press (1982)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: Essays in Logical Semantics. Reidel (1986)","DOI":"10.1007\/978-94-009-4540-1"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: Language in Action: Categories, Lambdas and Dynamic Logic. Elsevier (1991)","DOI":"10.1007\/BF00250539"},{"key":"11_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-75144-1_16","volume-title":"Logic, Language, and Computation","author":"J. Eijck van","year":"2007","unstructured":"van Eijck, J.: Natural logic for natural language. In: ten Cate, B.D., Zeevat, H.W. (eds.) TbiLLC 2005. LNCS (LNAI), vol.\u00a04363, pp. 216\u2013230. Springer, Heidelberg (2007)"},{"key":"11_CR27","unstructured":"Westerstahl, D., Peters, S.: Quantifiers in Language and Logic. Oxford University Press (2006)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-31262-5_17","volume-title":"Logical Aspects of Computational Linguistics","author":"T. Xue","year":"2012","unstructured":"Xue, T., Luo, Z.: Dot-types and their implementation. In: B\u00e9chet, D., Dikovsky, A. (eds.) LACL 2012. LNCS, vol.\u00a07351, pp. 234\u2013249. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43742-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T21:17:01Z","timestamp":1716844621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43742-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662437414","9783662437421"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43742-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}