Skip to main content

Dot-types and Their Implementation

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7351))

Abstract

Dot-types, as proposed by Pustejovsky and studied by many others, are special data types useful in formal semantics to describe interesting linguistic phenomena such as copredication. In this paper, we present an implementation of dot-types in the proof assistant Plastic base on their formalization in modern type theories.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Agda proof assistant (2008), http://appserv.cs.chalmers.se/users/ulfn/wiki/agda.php

  2. Asher, N.: A type driven theory of predication with complex types. Fundamenta Infor. 84(2) (2008)

    Google Scholar 

  3. Asher, N.: Lexical Meaning in Context: A Web of Words. Cambridge University Press (2011)

    Google Scholar 

  4. Asher, N., Pustejovsky, J.: Word meaning and commonsense metaphysics (2005)

    Google Scholar 

  5. Callaghan, P., Luo, Z.: An implementation of LF with coercive subtyping and universes. Journal of Automated Reasoning 27(1), 3–27 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cooper, R.: Copredication, Quantification and Frames. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 64–79. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Cooper, R.: Copredication, dynamic generalized quantification and lexical innovation by coercion. In: Proceedings of GL 2007, the Fourth International Workshop on Generative Approaches to the Lexicon (2007)

    Google Scholar 

  8. The Coq Development Team: The Coq Proof Assistant Reference Manual (Version 8.1), INRIA (2007)

    Google Scholar 

  9. Coquand, T., Huet, G.: The calculus of constructions. Infor. and Computation 76(2/3) (1988)

    Google Scholar 

  10. Luo, Y.: Coherence and Transitivity in Coercive Subtyping. Ph.D. thesis, University of Durham (2005)

    Google Scholar 

  11. Luo, Z.: Computation and Reasoning: A Type Theory for Computer Science. Oxford Univ. Press (1994)

    Google Scholar 

  12. Luo, Z.: Coercive subtyping. J. of Logic and Computation 9(1), 105–130 (1999)

    Article  MATH  Google Scholar 

  13. Luo, Z.: Type-theoretical semantics with coercive subtyping. Semantics and Linguistic Theory 20 (SALT20), Vancouver (2010)

    Google Scholar 

  14. Luo, Z.: Contextual Analysis of Word Meanings in Type-Theoretical Semantics. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 159–174. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Luo, Z., Luo, Y.: Transitivity in coercive subtyping. Infor. and Computation 197(1-2) (2005)

    Google Scholar 

  16. Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis (1984)

    Google Scholar 

  17. The Matita proof assistant (2008), http://matita.cs.unibo.it/

  18. Nordström, B., Petersson, K., Smith, J.: Programming in Martin-Löf’s Type Theory: An Introduction. Oxford University Press (1990)

    Google Scholar 

  19. Pustejovsky, J.: The Generative Lexicon. MIT (1995)

    Google Scholar 

  20. Pustejovsky, J.: A survey of dot objects (2005) (manuscript)

    Google Scholar 

  21. Pustejovsky, J.: Mechanisms of coercion in a general theory of selection (2011)

    Google Scholar 

  22. Ranta, A.: Type-Theoretical Grammar. Oxford University Press (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xue, T., Luo, Z. (2012). Dot-types and Their Implementation. In: Béchet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31262-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31261-8

  • Online ISBN: 978-3-642-31262-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics