References

  1. Aczel, P. and Gambino, N. (2000). Collection principles in dependent type theory. In International Workshop on Types for Proofs and Programs, Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds). Springer, 1–23.
  2. Adams, R. and Luo, Z. (2010). Weyl’s predicative classical mathematics as a logic-enriched type theory. ACM Transactions on Computational Logic (TOCL), 11(2), 1–17.
  3. Agda (2008). The Agda proof assistant (version 2). [Online]. Available: http://appserv.cs.chalmers.se/users/ulfn/wiki/agda.php [accessed 24th June 2020].
  4. Ahn, R. (2001). Agents, objects and events. PhD Thesis, Eindhoven University of Technology, Eindhoven.
  5. Ajdukiewicz, K. (1935). Die syntaktische konnexitat. Studia philosophica, 1–27. Antunes, S. and Chaves, R. (2003). On the licensing conditions of co-predication.
  6. Proceedings of the 2nd International Workshop on Generative Approaches to the Lexicon (GL 2007).
  7. Asher, N. (2008). A type driven theory of predication with complex types. Fundamenta Informaticae, 84(2), 151–183.
  8. Asher, N. (2012). Lexical Meaning in Context: A Web of Words. Cambridge University Press, Cambridge.
  9. Asher, N. and Luo, Z. (2013). Formalization of coercions in lexical semantics. Proceedings of Sinn und Bedeutung, 17, 63–80.
  10. Avigad, J., Donnelly, K., Gray, D. and Raff, P. ( 2007). A formally verified proof of the prime number theorem. ACM Transactions on Computational Logic (TOCL), 9(1), 2-es.
  11. Bahramian, H., Nematollahi, N., Sabry, A. (2017). Copredication in homotopy type theory. Unpublished manuscript, HAL.
  12. Bailey, A. (1999). The machine-checked literate formalisation of algebra in type theory. PhD Thesis, University of Manchester, Manchester.
  13. Baker, M. (2003). Lexical Categories: Verbs, Nouns and Adjectives. Cambridge University Press, Cambridge.
  14. Bar-Hillel, Y. (1953). A quasi-arithmetical notation for syntactic description. Language, 29(1), 47–58.
  15. Barendregt, H. (1992). Lambda calculi with types. In Handbook of Logic in Computer Science, Abramsky, S., Gabbay, D., Maibaum, T. (eds). Clarendon Press, Oxford.
  16. Barker, C. (2010). Nominals don’t provide criteria of identity. The Semantics of Nominalizations across Languages and Frameworks. Mouton de Gruyter, Berlin, 9–24.
  17. Barras, B. and Werner, B. (1997). Coq in coq. Technical report, INRIA-Rocquencourt, Rocquencourt.
  18. Bartsch, R. and Vennermann, T. (1973). Semantic Structures. Athenaum, New York, NY.
  19. Bassac, C., Mery, B., Retoré, C. (2010). Towards a type-theoretical account of lexical semantics. Journal of Logic, Language and Information, 19(2), 229–245.
  20. Beeson, M. (1985). Foundations of Constructive Mathematics. Springer-Verlag, Berlin, Heidelberg.
  21. Bekki, D. (2014). Representing anaphora with dependent types. International Conference on Logical Aspects of Computational Linguistics. Springer, 14–29.
  22. Bekki, D. and Mineshima, K. (2017). Context-passing and underspecification in dependent type semantics. In Modern Perspectives in Type-Theoretical Semantics, Chatzikyriakidis, S., Luo, Z. (eds). Springer, Berlin, Heidelberg.
  23. Bernardy, J.-P. and Chatzikyriakidis, S. (2017). A type-theoretical system for the FraCaS test suite: Grammatical framework meets Coq. IWCS 2017–12th International Conference on Computational Semantics–Long papers.
  24. Bernardy, J.-P. and Chatzikyriakidis, S. (2019). Dynamic FraCoq: A type-theoretical dynamic semantics system for natural language inference. Proceedings of NODALIDA2020.
  25. Bernardy, J.-P., Blanck, R., Chatzikyriakidis, S., Lappin, S. (2018). A compositional bayesian semantics for natural language. Proceedings of the First International Workshop on Language Cognition and Computational Models, 1–10.
  26. Bernardy, J.-P., Blanck, R., Chatzikyriakidis, S., Lappin, S., Maskharashvili, A. (2019). Bayesian inference semantics: A modelling system and a test suite. Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (* SEM 2019), 263–272.
  27. Bertot, Y. and Casteran, P. (2004). Interactive Theorem Proving and Program Development. Springer-Verlag, Berlin, Heidelberg.
  28. Betarte, G. (1998). Dependent record types and algebraic structures in type theory. PhD Thesis, Chalmers University of Technology, Gothenburg.
  29. Bishop, E. (1967). Foundations of Constructive Analysis. McGraw-Hill, New York, NY.
  30. Boldini, P. (2000). Formalizing contexts in intuitionistic type theory. Fundamenta Informaticae, 4(2), 105–127.
  31. Brandom, R. (1994). Making It Explicit: Reasoning, Representing, and Discursive Commitment. Harvard University Press, Cambridge, MA.
  32. Brandom, R. (2000). Articulating Reasons: An Introduction to Inferentialism. Harvard University Press, Cambridge, MA.
  33. Callaghan, P. and Luo, Z. (2001). An implementation of LF with coercive subtyping and universes. Journal of Automated Reasoning, 27(1), 3–27.
  34. Carlson, G.N. (1977). Reference to kinds in English. PhD Thesis, UMass, Amherst, MA.
  35. Carnap, R. (1947). Meaning and Necessity. University of Chicago Press, Chicago, IL.
  36. Cervesato, I. and Pfenning, F. (2002). A linear logical framework. Information and Computation, 179(1), 19–75.
  37. Champollion, L. (2015). The interaction of compositional semantics and event semantics. Linguistics and Philosophy, 38, 31–66.
  38. Chatzikyriakidis, S. (2014). Adverbs in a modern type theory. In Proceedings of Logical Aspects of Computational Linguistics: LACL 2014. Asher, N., Soloviev, S. (eds). Berlin, Heidelberg, 44–56.
  39. Chatzikyriakidis, S. and Luo, Z. (2012). An account of natural language coordination in type theory with coercive subtyping. In Proceedings of Constraint Solving and Language Processing: CSLP 2012. Parmentier, Y., Duchier, D. (eds). Orléans, 31–51.
  40. Chatzikyriakidis, S. and Luo, Z. (2013). Adjectives in a modern type-theoretical setting. In Proceedings of Formal Grammar: FG 2013, FG 2012, Morrill, G. and Nederhof, M.J. (eds). Springer, Berlin, Heidelberg, 159–174.
  41. Chatzikyriakidis, S. and Luo, Z. (2014). Natural language inference in Coq. Journal of Logic, Language and Information, 23(4), 441–480.
  42. Chatzikyriakidis, S. and Luo, Z. (2015). Individuation criteria, dot-types and copredication: A view from modern type theories. Proceedings of the Mathematics of Language 2015, ACL Anthology, 39–50.
  43. Chatzikyriakidis, S. and Luo, Z. (2016). Proof assistants for natural language semantics. In International Conference on Logical Aspects of Computational Linguistics. Springer, Berlin, Heidelberg, 85–98.
  44. Chatzikyriakidis, S. and Luo, Z. (2017a). Adjectival and adverbial modification: The view from modern type theories. Journal of Logic, Language and Information, 26, 45–88.
  45. Chatzikyriakidis, S. and Luo, Z. (2017b). On the interpretation of common nouns: Types v.s. predicates. In Modern Perspectives in Type-Theoretical Semantics. Springer, Berlin, Heidelberg.
  46. Chatzikyriakidis, S. and Luo, Z. (2018). Identity criteria of common nouns and dot-types for copredication. Oslo Studies in Language, 10(2), 121–141.
  47. Chatzikyriakidis, S. and Luo, Z. (2020). Gradability in MTT-semantics. Postproceedings of the Thirteenth International Tbilisi Symposium on Language, Logic and Computation (TbiLLC 2019), Tbilisi.
  48. Chatzikyriakidis, S., Lafourcade, M., Ramadier, L., Zarrouk, M. (2017). Type theories and lexical networks: Using serious games as the basis for multi-sorted typed systems. Journal of Language Modelling, 5(2), 229–272.
  49. Chierchia, G. (1995). Individual-Level Predicates as Inherent Generic. University of Chicago Press, Chicago.
  50. Chlipala, A. (2013). Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant. MIT Press, Cambridge, MA.
  51. Chomsky, N. (2000). New Horizons in the Study of Language and Mind. Cambridge University Press, Camridge.
  52. Church, A. (1940). A formulation of the simple theory of types. The Journal of Symbolic Logic, 5(1), 56–68.
  53. Clark, S. and Curran, J.R. (2007). Wide-coverage efficient statistical parsing with ccg and log-linear models. Computational Linguistics, 33(4), 493–552.
  54. Cohen, S.M. (1984). Aristotle and individuation. Canadian Journal of Philosophy, 14(sup1), 41–65.
  55. Constable, R., Allen, S.F., Bromley, H.M., Cleaveland, W.R., Cremer, J.F., Haprer, R., Howe, D.J., Knoblock, T.B., Mendler, N.P., Panangaden, P., Sasaki, J.T., and Smith, S. (1986). Implementing Mathematics with the NuPRL Proof Development System. Pretice-Hall, Upper Saddle River, NJ.
  56. Constantinescu, C. (2013). Big eaters and real idiots: Evidence for adnominal degree modification? Sinn und Bedeutung, 17, 183–200.
  57. Cooper, R. (2005). Records and record types in semantic theory. Journal of Logic and Computation, 15(2), 99–112.
  58. Cooper, R. (2011). Copredication, quantification and frames. In Proceedings of Logical Aspects of Computational Linguistics: LACL 2011, Pogodalla, S., and Prost, J.P. (eds). Springer, Berlin, Heidelberg, 64–79.
  59. Cooper, R. (2017). Adapting type theory with records for natural language semantics. In Modern Perspectives in Type-Theoretical Semantics, Chatzikyriakidis, S., Luo, Z. (eds). Springer, Berlin, Heidelberg.
  60. Cooper, R., Crouch, D., van Eijck, J., Fox, C., van Genabith, J., Jaspars, J., Kamp, H., Milward, D., Pinkal, M., Poesio, M., Pulman, S., Briscoe, T., Maier, H., Konrad, K. (1996). Using the framework. Technical Report LRE 62-051 D-16, The FraCaS Consortium, Stanford, CA.
  61. Cooper, R., Dobnik, S., Lappin, S., Larsson, S. (2015). Probabilistic type theory and natural language semantics. Linguistic Issues in Language Technology, 10, 1–43.
  62. Coppo, M. and Dezani-Ciancaglini, M. (1980). An extension of the basic functionality theory for the λ-calculus. Notre Dame Journal of Formal Logic, 21(4), 685–693.
  63. Coppo, M., Dezani-Ciancaglini, M., Venneri, B. (1980). Principal type schemes and λ-calculus semantics, Seldin, J.P. and Hindley, J.R. (eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London, 535–560.
  64. Coq (2010). The Coq Proof Assistant Reference Manual (Version 8.3). INRIA. Coquand, T. and Huet, G. (1988). The calculus of constructions. Information and Computation, 76(2–3), 95–120.
  65. Curry, H. and Feys, R. (1958). Combinatory Logic, Volume 1. North Holland Publishing Company, Amsterdam.
  66. Dapoigny, R. and Barlatier, P. (2010). Modeling contexts with dependent types. Fundamenta Informaticae, 104(4), 293–327.
  67. Davidson, D. (1967). The logical form of action sentences. In The Logic of Decision and Action, Rothstein, S. (ed.). University of Pittsburgh Press, Pittsburgh, PA, 216–234.
  68. De Bruijn, N. (1980). A survey of the project AUTOMATH. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Hindley, J. and Seldin, J. (eds). Academic Press, London.
  69. De Groote, P. (2001). Towards abstract categorial grammars. Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, 252–259.
  70. De Groote, P. and Maarek, S. (2007). Type-theoretic extensions of abstract categorial grammars. Proceedings of the Workshop on New Directions in Type-theoretic Grammars. ESSLLI 2007, Dublin.
  71. De Groote, P. and Winter, Y. (2014). A type-logical account of quantification in event semantics. JSAI International Symposium on Artificial Intelligence. Springer, Berlin, Heigelberg, 53–65.
  72. De Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J. (2015). The Lean theorem prover (system description). In Automated Deduction – CADE-25. CADE 2015, Felty, A. and Middeldorp, A. (eds). Springer, Cham, 378–388.
  73. Dik, S.C. (1972). The semantic representation of manner adverbials. Linguistics in the Netherlands, 1973(1), 96–121.
  74. Dowty, D., Wall, R., Peters, S. (1981). Introduction to Montague Semantics. Springer, Cham.
  75. Dummett, M. (1975). The philosophical basis of intuitionistic logic. In Proceedings of the Logic Colloquium, 1973, Rose, H. and Shepherdson, J. (eds). North Holland. Publishing Company, Amsterdam. Reprinted in Philosophy of Mathematics: Selected Readings, Benacerraf, P. and Putnam, H., (eds). Cambridge University Press, Cambridge.
  76. Dummett, M. (1991). The Logical Basis of Metaphysics. Duckworth, London.
  77. Ernst, T.B. (2002). The Syntax of Adjuncts, Cambridge University Press, Cambridge.
  78. Falkum, I.L. (2011). The semantics and pragmatics of polysemy: A relevancetheoretic account. PhD Thesis, University College London, London.
  79. Francez, N. (2015). Proof-Theoretic Semantics. Studies in Logic, College Publications, London.
  80. Frege, G. (1884). Grundlagen der Arithmetik. Basil Blackwell, Oxford. (Translation by J. Austin in 1950: The Foundations of Arithmetic).
  81. Gallin, D. (1975). Intensional and Higher-order Modal Logic: With Applications to Montague Semantics. North-Holland Publishing Company, Amsterdam.
  82. Gambino, N. and Aczel, P. (2006). The generalised type-theoretic interpretation of constructive set theory. Journal of Symbolic Logic, 71(1), 67–103.
  83. Geach, P. (1962). Reference and Generality: An Examination of Some Medieval and Modern Theories. Cornell University Press, Ithaca, NY.
  84. Gentzen, G. (1935). Untersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39, 176–210.
  85. Girard, J.-Y. (1972). Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur. PhD Thesis, Université Paris VII, Paris.
  86. Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science, 50(1), 1–101.
  87. Goguen, J.A. and Burstall, R.M. (1983). Introducing institutions. In Workshop on Logic of Programs. Springer, Berlin, Heidelberg, 221–256.
  88. Gonthier, G. (2008). Formal proof – The four-color theorem. Notices of the AMS, 55(11), 1382–1393.
  89. Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Ould Biha, S. (2013). A machine-checked proof of the odd order theorem. In Interactive Theorem Proving, Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds), Springer, Berlin, Heidelberg, 163–179.
  90. Goodman, N. and Lassiter, D. (2015). Probabilistic semantics and pragmatics: Uncertainty in language and thought. In The Handbook of Contemporary Semantic Theory, 2nd edition, Lappin, S., Fox, C. (eds). Wiley-Blackwell, Malden, Oxford, 655–686.
  91. Gordon, M. and Melham, T. (1993). Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge.
  92. Gotham, M. (2014). Copredication, quantification and individuation. PhD Thesis, University College London, London.
  93. Gotham, M. (2017). Composing criteria of individuation in copredication. Journal of Semantics, 34(2), 333–371.
  94. Groenendijk, J. and Stokhof, M. (1991). Dynamic predicate logic. Linguistics and Philosophy, 14(1), 39–100.
  95. Grudzińska, J. and Zawadowski, M. (2017). Generalized quantifiers on dependent types: A system for anaphora. In Modern Perspectives in Type-Theoretical Semantics, Chatzikyriakidis, S., Luo, Z. (eds). Springer, Berlin, Heidelberg, 95–131.
  96. Gupta, A. (1980). The Logic of Common Nouns. Yale University Press, New Haven, CT.
  97. Hales, T.C. (2007). The Jordan curve theorem, formally and informally. American Mathematical Monthly, 114(10), 882–894.
  98. Hallgren, T. and Ranta, A. (2000). An extensible proof text editor. In Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11–12, Parigot, M., Voronkov, A. (eds). Springer, Berlin, Heidelberg, 70–84.
  99. Harper, R. and Pollack, R. (1989). Type checking, universe polymorphism, and typical ambiguity in the calculus of constructions draft. In International Joint Conference on Theory and Practice of Software Development, Díaz, J., Orejas, F. (eds). Springer, Berlin, Heidelberg, 241–256.
  100. Harper, R., Honsell, F., Plotkin, G. (1993). A framework for defining logics. Journal of the Association for Computing Machinery, 40(1), 143–184.
  101. Hayashi, S. (1991). Singleton, union and intersection types for program extraction. In International Symposium on Theoretical Aspects of Computer Software, Ito, T., Meyer, A.R. (eds). Springer, Berlin, Heidelberg, 701–730.
  102. Heim, I. (1983). File change semantics and the familiarity theory of definiteness. Semantics Critical Concepts in Linguistics, 108–135.
  103. Heim, I. (2000). Degree operators and scope. Proceedings of SALT, 10, 40–64.
  104. Henkin, L. (1950). Completeness in the theory of types. Journal of Symbolic Logic, 15, 81–91.
  105. Hoeksema, J. (1998). The semantics of non-boolean. Journal of Semantics, 6, 19–40. HoTT, (2013). Homotopy type theory: Univalent foundations of mathematics, the univalent foundations program. Technical report, Institute for Advanced Study, Princeton, NJ.
  106. Howard, W.A. (1980). The formulae-as-types notion of construction. In To H.B. Curry: Essays on Combinatory Logic, Hindley, J., Seldin, J. (eds). Academic Press, 479–490.
  107. Jackendoff, R. (1972). Semantic Interpretation in Generative Grammar. MIT Press, Cambridge, MA.
  108. Kahle, R. and Schroeder-Heister, P. (eds) (2006). Introduction: Proof-theoretic semantics. Synthese, Springer. Special Issue of Synthese, 148(3), 503–743.
  109. Kamp, H. (1975). Two theories about adjectives. In Formal Semantics of Natural Language, Keenan, E. (ed.). Cambridge University Press, Cambridge, 123–155.
  110. Kamp, H. (1981). A theory of truth and semantic representation. In Formal Methods in the Study of Language, Groenendijk, J., Janssen, T., Stokhof, M. (eds.), Mathematical Centre, Amsterdam, 277–322
  111. Kennedy, C. (1999). Projecting the Adjective: The Syntax and Semantics of Gradability and Comparison. Routledge, New York, NY.
  112. Kennedy, C. (2007). Vagueness and grammar: The semantics of relative and absolute gradable adjectives. Linguistics and Philosophy, 30(1), 1–45.
  113. Kinoshita, E., Mineshima, K., Bekki, D. (2016). An analysis of selectional restrictions with dependent type semantics. In JSAI International Symposium on Artificial Intelligence. Springer, Berlin, Heidelberg, 19–32.
  114. Klein, E. (1980). A semantics for positive and comparative adjectives. Linguistics and Philosophy, 4(1), 1–45.
  115. Korniłowicz, A. (2005). Jordan curve theorem. Formalized Mathematics, 13(4), 481–491.
  116. Kratzer, A. (1995). Individual level predicates vs. stage level predicates. In The Generic Book. The University of Chicago Press, Chicago, 125–175.
  117. Kratzer, A. and Heim, I. (1998). Semantics in Generative Grammar, Volume 1185. Blackwell, Oxford.
  118. Krishnaswami, N.R., Pradic, P., Benton, N. (2015). Integrating linear and dependent types. ACM SIGPLAN Notices, 50(1), 17–30.
  119. Kubota, Y. and Levine, R. (2015). Against ellipsis: Arguments for the direct licensing of “noncanonical coordinations”. Linguistics and Philosophy, 38(6), 521–576.
  120. Lafourcade, M. (2007). Making people play for lexical acquisition with the jeuxdemots prototype. In SNLP’07: 7th International Symposium on Natural Language Processing, Kawtrakul, A., Zock, M., Phantachat, W. (eds). Pattaya, Thailand.
  121. Lambek, J. (1958). The mathematics of sentence structure. The American Mathematical Monthly, 65(3), 154–170.
  122. Landman, F. (1996). Plurality. In The Handbook of Contemporary Semantic Theory, Lappin, S. (ed.), Blackwell, Oxford.
  123. Landman, F. (2000). Events and Plurality. Kluwer, Dordrecht.
  124. Lassiter, D. (2014). Adjectival modification and gradation. In The Handbook of Contemporary Semantic Theory, Lappin, S., Fox, C. (eds). Wiley-Blackwell, Oxford.
  125. Lassiter, D. and Goodman, N. (2017). Adjectival vagueness in a Bayesian model of interpretation. Synthese, 194, 3801–3836.
  126. Leroy, X. (2013). The compcert c verified compiler: Documentation and users manual [Online]. Available: http://compcert.inria.fr/man/manual.pdf [accessed 24 June 2020].
  127. Lewis, D. (1970). General semantics. Synthese, 22(1), 18–67.
  128. Liebesman, D. and Magidor, O. (2017). Copredication and property inheritance. Philosophical Issues, 27(1), 131–166.
  129. Link, G. (1983). The logical analysis of plurals and mass terms: A lattice-theoretical approach. In Meaning, Use an Interpretation of Language, Bauerle, S.C.R., von Stechow, A. (eds). Mouton De Gruyter, Berlin, 302–323.
  130. Link, G. (1998). Algebraic Semantics in Language and Philosophy. CSLI Lecture Notes No. 74, Stanford University, Stanford, CA.
  131. Linsky, B. (2009). Leon Chwistek’s theory of constructive types. In The Golden Age of Polish Philosophy, Lapointe, S., Wolenski, J., Marion, M., Miskiewicz, W. (eds). Springer, Berlin, Heidelberg.
  132. Ljunglöf, P. and Siverbo, M. (2012). A bilingual treebank for the FraCaS test suite. SLTC 2012, 53–54.
  133. Lungu, G. (2018). Subtyping in signatures. PhD Thesis, Royal Holloway, University of London, London.
  134. Lungu, G.E. and Luo, Z. (2014). Monotonicity reasoning in formal semantics based on modern type theories. In International Conference on Logical Aspects of Computational Linguistics, Asher, N., Soloviev, S. (eds). Springer, Berlin, Heidelberg,138–148.
  135. Lungu, G.E. and Luo, Z. (2018). On subtyping in type theories with canonical objects. 22nd International Conference on Types for Proofs and Programs (TYPES 2016T), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Wadern.
  136. Luo, Z. (1990a). An extended calculus of constructions. PhD Thesis, University of Edinburgh, Edinburgh.
  137. Luo, Z. (1990b). A problem of adequacy: Conservativity of calculus of constructions over higher-order logic. Technical report, LFCS report series ECS-LFCS-90-121, Department of Computer Science, University of Edinburgh, Edinburgh.
  138. Luo, Z. (1994). Computation and Reasoning: A Type Theory for Computer Science. Oxford University Press, Oxford.
  139. Luo, Z. (1997). Coercive subtyping in type theory. Proceedings of CSL’96, the 1996 Annual Conference of the European Association for Computer Science Logic, LNCS’1258, Utrecht.
  140. Luo, Z. (1999). Coercive subtyping. Journal of Logic and Computation, 9(1), 105–130.
  141. Luo, Z. (2007). A type-theoretic framework for formal reasoning with different logical foundations. Advances in Computer Science, Proceedings of the 11th Annual Asian Computing Science Conference. LNCS 4435, Berlin, Heidelberg, 214–222.
  142. Luo, Z. (2009a). Dependent record types revisited. Proceedings of the International Workshop on Modules and Libraries for Proof Assistants, Montreal. ACM International Conference Proceeding Series, 429.
  143. Luo, Z. (2009b). Manifest fields and module mechanisms in intensional type theory. Types for Proofs and Programs, Proceedings of International Conference of TYPES’08, Berardi, S., Damiani, F., de’Liguoro, U. (eds). LNCS 5497.
  144. Luo, Z. (2009c). Type-theoretical semantics with coercive subtyping. Semantics and Linguistic Theory 20 (SALT20). Vancouver, 38–56.
  145. Luo, Z. (2011a). Adjectives and adverbs in type-theoretical semantics. Notes.
  146. Luo, Z. (2011b). Contextual analysis of word meanings in type-theoretical semantics. Logical Aspects of Computational Linguistics (LACL’2011). LNAI 6736, Berlin, Heidelberg, 159–174.
  147. Luo, Z. (2012a). Common nouns as types, In Logical Aspects of Computational Linguistics (LACL’2012), Bechet, D. and Dikovsky, A. (eds). LNCS 7351, Berlin, Heidelberg.
  148. Luo, Z. (2012b). Formal semantics in modern type theories with coercive subtyping. Linguistics and Philosophy, 35(6), 491–513.
  149. Luo, Z. (2012c). Notes on uiniverses in type theory. Notes for a talk at The Institute of Advanced Studies, Princeton, NJ.
  150. Luo, Z. (2014). Formal semantics in modern type theories: Is it model-theoretic, proof-theoretic, or both? Logical Aspects of Computational Linguistics 2014 (LACL 2014). Toulouse. LNCS 8535, Berlin, Heidelberg, 177–188.
  151. Luo, Z. (2015). A Lambek calculus with dependent types. TYPES 2015, Tallinn.
  152. Luo, Z. (2017). Beliefs in type theory. Royal Holloway, University of London, London.
  153. Luo, Z. (2018a). Formal semantics in modern type theories (and event semantics in MTT-framework). LACompLing18, Stockholm.
  154. Luo, Z. (2018b). Notes on LTYPE for coordinations. Notes.
  155. Luo, Z. (2018c). Substructural calculi with dependent types. Linearity and TLLA 2018, Oxford.
  156. Luo, Z. (2019a). MTT-semantics is model-theoretic as well as proof-theoretic [Manuscript]. Available at: http://www.cs.rhul.ac.uk/ home/zhaohui/BOTH.pdf.
  157. Luo, Z. (2019b). Proof irrelevance in type-theoretical semantics. Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018), Studies in Computational Intelligence (SCI). Springer, Berlin, Heiledberg, 1–15.
  158. Luo, Z. and Callaghan, P. (1997). Mathematical vernacular and conceptual wellformedness in mathematical language. International Conference on Logical Aspects of Computational Linguistics. Springer, Berlin, Heiledberg, 231–250.
  159. Luo, Z. and Callaghan, P. (1998). Coercive subtyping and lexical semantics (extended abstract) [Online]. Available on request from the second author or at: http://www.cs.rhul.ac.uk/home/zhaohui/LACL98.abstract.pdf.
  160. Luo, Z. and Pollack, R. (1992). LEGO proof development system: User’s manual. LFCS Report ECS-LFCS-92-211, Deptartment of Computer Science, University of Edinburgh, Edinburgh.
  161. Luo, Z. and Soloviev, S. (2017). Dependent event types. In Logic, Language, Information, and Computation, in d.Q.R. Kennedy, J. (ed.). WoLLIC 2017, LNCS, vol. 10388, Springer, Berlin.
  162. Luo, Z. and Soloviev, S. (2020). Dependent event types, Manuscript.
  163. Luo, Z. and Xue, T. (2020). Disjointness of types and negative occurrences. Notes.
  164. Luo, Z., Soloviev, S., Xue, T. (2012). Coercive subtyping: Theory and implementation. Information and Computation, 223, 18–42.
  165. Maclean, H. and Luo, Z. (2020). Subtype uiniverses (extended abstract). Proceedings of the 26th International Conference on Types for Proofs and Programs (TYPES20), Turin.
  166. Maienborn, C. and Schafer, M. (2011). Adverbs and adverbials. In Semantics. An International Handbook of Natural Language Meaning, Maienborn, C., von Heusinger, K., Portner, P. (eds). De Gruyter Mouton, Berlin, 1390–1420.
  167. Martin-Löf, P. (1975). An intuitionistic theory of types: Predicative part. In Studies in Logic and the Foundations of Mathematics, Elsevier, 80, 73–118.
  168. Martin-Löf, P. (1984). Intuitionistic Type Theory. Bibliopolis, Naples.
  169. Martin-Löf, P. (1996). On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic, 1(1), 11–60.
  170. Mat (2008). The Matita proof assistant [Online]. Available at: http://matita.cs.unibo.it/ [accessed 24 June 2020].
  171. McBride, C. (2002). Elimination with a motive. In Types for Proofs and Programs, Proceedings of TYPES 2000. LNCS 2277. Springer, Berlin, Heidelberg.
  172. McBride, C. and McKinna, J. (2004). The view from the left. Journal of Functional Programming, 14(1), 69–111.
  173. McConnell-Ginet, S.M. (1982). Adverbs and logical form: A linguistically realistic theory. Language, 58(1), 144–184.
  174. McConnell-Ginet, S.M. (1973). Comparative constructions in English: A syntactic and semantic analysis, PhD dissertation, University of Rochester, Rochester, NY.
  175. Mery, B., Moot, R., Retoré, C. (2018). Solving the individuation and counting puzzle with λ-DRT and MGL. In JSAI International Symposium on Artificial Intelligence, Springer, Berlin, Heidelberg, 298–312.
  176. Mineshima, K., Martınez-Gómez, P., Miyao, Y., Bekki, D. (2015), Higher-order logical inference with compositional semantics. Proceedings of EMNLP 2015, Lisbon.
  177. Mönnich, U. (1985). Untersuchungen zu einer konstruktiven Semantik fur ein Fragment des Englischen. Habilitation, University of Tübingen, Tübingen.
  178. Montague, R. (1970). English as a formal language. In Linguaggi nella Società e nella, Visentini, B. (ed.). Edizioni di Comunità, Milan.
  179. Montague, R. (1973). The proper treatment of quantification in ordinary English. In Approaches to Natural Languages, Hintikka, J., Moravcsik, J., Suppes, P. (eds). reprinted in Montague (1974).
  180. Montague, R. (1974). Formal Philosophy. Yale University Press. Collected papers edited by R. Thomason.
  181. Moortgat, M. (1988). Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus. Walter de Gruyter, Berlin.
  182. Morrill, G. (2011). Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press, Oxford.
  183. Morzycki, M. (2009). Degree modification of gradable nouns: Size adjectives and adnominal degree morphemes. Natural Language Semantics, 17(2), 175–203.
  184. Murphy, G. (2004). The Big Book of Concepts. MIT Press, Cambridge, MA.
  185. Naumowicz, A. and Korniłowicz, A. (2009). A brief overview of Mizar. In International Conference on Theorem Proving in Higher Order Logics. Springer, Berlin, Heidelberg, 67–72.
  186. Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (1994). Selected Papers on Automath. Elsevier, Amesterdam.
  187. Nipkow, T., Paulson, L.C., Wenzel, M. (2002). Isabelle/HOL: A Proof Assistant for Higher-order Logic, Volume 2283. Springer Science & Business Media, Berlin, Heidelberg.
  188. Nordström, B., Petersson, K., Smith, J. (1990). Programming in Martin-Löf’s Type Theory: An Introduction. Oxford University Press, Oxford.
  189. Nunberg, G. (1995). Transfers of meaning. Journal of Semantics, 12(2), 109–132.
  190. Ortega-Andrés, M. and Vicente, A. (2019). Polysemy and co-predication. Glossa: A Journal of General Linguistics, 4(1), 1–23.
  191. Paradis, C. (2001). Adjectives and boundedness. Cognitive Linguistics, 12(1), 47–65. Parsons, T. (1972). Some problems concerning the logic of grammatical modifiers. In Semantics of Natural Language, Davidson, D., Harman, G. (eds). Reidel, Dordrecht, 127–141.
  192. Parsons, T. (1990). Events in the Semantics of English. MIT Press, Cambridge, MA.
  193. Partee, B.H. (1988). Possible worlds in model-theoretic semantics: A linguistic perspective. In Possible Worlds in Humanities, Arts, and Sciences: Proceedings of Nobel Symposium 65, Allen, S. (ed.). Walter de Gruyter, Berlin, 93–123.
  194. Partee, B.H. (2002). Noun phrase interpretation and type-shifting principles. Formal Semantics: The Essential Readings, 357–381.
  195. Partee, B.H. (2007). Compositionality and coercion in semantics: The dynamics of adjective meaning. Cognitive Foundations of Interpretation, 2007, 145–161.
  196. Partee, B.H. (2010). Privative adjectives: Subsective plus coercion. In Presuppositions and Discourse: Essays Offered to Hans Kamp, Bauerle, R., Reyle, U., Zimmermann, T. (eds). Emerald Group Publishing Ltd, Bingley.
  197. Partee, B.H. and Rooth, M. (1983). Generalized conjunction and type ambiguity. In Meaning, Use, and Interpretation of Language, Bauerle, R., Schwarze, C., von Stechow, A. (eds). Mouton De Gruyter, Berlin.
  198. Peregrin, J. (2013). Inferentialism and normativity. In The Oxford Handbook of the History of Analytic Philosophy, Beaney, M. (ed.). Oxford University Press, Oxford.
  199. Piñón, C. (2013). Speech-act adverbs as manner adverbs. University of Lille, Lille.
  200. Pollack, R. (2002). Dependently typed records in type theory. Formal Aspects of Computing, 13, 386–402.
  201. Portner, P. (2005). What is Meaning: Fundamentals of Formal Semantics. Blackwell, Hoboken, NJ.
  202. Prawitz, D. (1973). Towards a foundation of a general proof theory. In Studies in Logic and the Foundations of Mathematics, 74, 225–250.
  203. Prawitz, D. (1974). On the idea of a general proof theory. Synthese, 27, 63–77.
  204. Pustejovsky, J. (1995). The Generative Lexicon. MIT, Cambridge, MA.
  205. Pustejovsky, J. (2005). A survey of dot objects. Author’s weblog.
  206. Ramsey, F. (1926). The foundations of mathematics. Proceedings of the London Mathematical Society, 25(1), 338–384.
  207. Ranta, A. (1993). Type theory and the informal language of mathematics. In International Workshop on Types for Proofs and Programs, Barendregt, H., Nipkow, T. (eds). Springer, Berlin, Heidelberg, 352–365.
  208. Ranta, A. (1994). Type-Theoretical Grammar. Oxford University Press, Oxford.
  209. Ranta, A. (1998). Syntactic calculus with dependent types. Journal of Logic, Language and Information, 7, 413–431.
  210. Ranta, A. (2011). Grammatical Framework: Programming with Multilingual Grammars. CSLI Publications, Stanford, CA.
  211. Ranta, A. (2015). Constructive type theory. In The Handbook of Contemporary Semantic Theory, 2nd edition, Lappin, S., Fox, C. (eds). Wiley-Blackwell, Oxford 343–374.
  212. Ranta, A. and Cooper, R. (2004). Dialogue systems as proof editors. Journal of Logic, Language and Information, 13(2), 225–240.
  213. Retoré, C. (2013). The Montagovian generative lexicon Tyn: A type theoretical framework for natural language semantics. In Proceedings of TYPES2013, Matthes, R., Schubert, A. (eds). TYPES, Toulouse.
  214. Rexach, J. (1997). Questions and Generalized Quantifiers. Springer, Dordrecht.
  215. Reynolds, J.C. (1974). Towards a theory of type structure. In Programming Symposium. Springer, Berlin, Heidelberg, 408–425.
  216. Russell, B. (1903). The Principles of Mathematics. Routledge, Abingdon.
  217. Saeed, J. (1997). Semantics. Wiley-Blackwell, Hoboken, NJ.
  218. Saibi, A. (1997). Typing algorithm in type theory with inheritance. In Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 292–301.
  219. Sassoon, G. (2012). A typology of multidimensional adjectives. Journal of Semantics, 30(3), 335–380.
  220. Sassoon, G.W. and Fadlon, J. (2017). The role of dimensions in classification under predicates predicts their status in degree constructions. Glossa: A Journal of General Linguistics, 2(1).
  221. Schäfer, M. (2008). Resolving scope in manner modification. In Empirical Issues in Syntax and Semantics, 7, 351–372.
  222. Schreiber, P. (1972). Style disjuncts and the performative analysis. Linguistic Inquiry, 3(3), 321–347.
  223. Soloviev, S. and Luo, Z. (2002). Coercion completion and conservativity in coercive subtyping. Annals of Pure and Applied Logic, 113(1–3), 297–322.
  224. Solt, S. (2009). The semantics of adjectives of quantity. PhD Thesis, The City University of New York, NY.
  225. Steedman, M. (2000). The Syntactic Process, MIT Press, Cambridge, MA.
  226. Strachey, C. (2000). Fundamental concepts in programming languages. Higher-Order and Symbolic Computation, 13(1–2), 11–49.
  227. Sundholm, G. (1986). Proof theory and meaning. In Handbook of Philosophical Logic, Springer, Berlin, Heidelberg, 471–506.
  228. Sundholm, G. (1989). Constructive generalized quantifiers. Synthese, 79(1), 1–12.
  229. Tanaka, R. (2015). Generalized quantifiers in dependent type semantics. Talk, Ohio State University, Columbus, OH.
  230. Tasistro, A. (1997). Substitution, record types and subtyping in type theory. PhD Thesis, Chalmers University of Technology, Gothengurg.
  231. Vákár, M. (2015). A categorical semantics for linear logical frameworks. In International Conference on Foundations of Software Science and Computation Structures. Springer, Berlin, Heidelberg, 102–116.
  232. Van Benthem, J. (1988). The semantics of variety in categorial grammar. Categorial Grammar, 25, 37–55.
  233. Van Benthem, J. (2013). The Logic of Time: A Model-Theoretic Investigation into the Varieties of Temporal Ontology and Temporal Discourse, Springer Science & Business Media, Dordrecht.
  234. Von Ahn, L. and Dabbish, L. (2008). Designing games with a purpose. Commun. ACM, 51(8), 58–67.
  235. Von Fintel, K. (1993). Exceptive constructions. Natural Language Semantics, 1(2), 123–148.
  236. Von Stechow, A. (1984). Comparing semantic theories of comparison. Journal of Semantics, 3(1), 1–77.
  237. Whitehead, A. and Russell, B. (1925). Principia Mathematica, 2nd edition, Cambridge University Press, Cambridge.
  238. Wilhelm, G. (2000). Oriented adverbs. Issues in the lexical semantics of event adverbs. PhD Thesis, Universität Tübingen, Tubingen.
  239. Winter, Y. (2016). Elements of Formal Semantics. Edinburgh University Press, Edinburgh.
  240. Winter, Y. and Zwarts, J. (2011). Event semantics and abstract categorial grammar. In Conference on Mathematics of Language. Springer, Berlin, Heidelberg, 174–191.
  241. Xue, T. and Luo, Z. (2012). Dot-types and their implementation. In International Conference on Logical Aspects of Computational Linguistics. Springer, Berlin, Heidelberg, 234–249.
  242. Xue, T. and Luo, Z., Chatzikyriakidis, S. (2018). Propositional forms of judgmental interpretations. Proceedings of Workshop on Natural Language and Computer Science, Oxford.
  243. Xue, T., Luo, Z., Chatzikyriakidis, S. (2020). Propositional forms of judgmental interpretations. Natural Language in Computer Science 2018 (NLCS2018), Oxford.
  244. Yehoshua, B.-H., Haïm, G., Shamir, E. (1960). On categorial and phrase-structure grammars. Bulletin of the Research Council of Israël, , 9F, 1–16.
  245. Zwanziger, C. (2019). Dependently-typed Montague semantics in the proof assistant agda-flat. In Proceedings of the 16th Meeting on the Mathematics of Language, de Groote, P., Drewes, F., Penn, G. (eds). Association for Computational Linguistics, 40–49.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.149.29.168