Skip to main content
SpringerLink
Log in

Representing Covert Movements by Delimited Continuations

  • Conference paper
  • First Online:
New Frontiers in Artificial Intelligence (JSAI-isAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6284))

Included in the following conference series:

Abstract

In phenomena which have been claimed to require “covert movements” in generative terms, a relevant lexical item seems to require a means to somehow refer to the meaning of its surroundings in order for the meaning of the whole sentence to be properly computed. This has motivated generative/transformational grammars to adopt a movement of the relevant item to the position where its scope contains surroundings that influence its meaning, while it remains as an issue to be solved for categorial/Lambek-style grammars, namely, grammars without movements.

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

Access this chapter

Log in via an institution
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. Barker, C.: Introducing Continuations. In: Hastings, R., Jackson, B., Zvolenszky, Z. (eds.) SALT 11, CLC Publications, Ithaca (2001)

    Google Scholar 

  2. Barker, C.: Continuations and the Nature of Quantification. Natural Language Semantics 10(3), 211–241 (2002)

    Article  Google Scholar 

  3. Barker, C.: Continuations in Natural Language. In: H. Thielecke (ed.): the Fourth ACM SIGPLAN Continuations Workshop (CW 2004). Technical Report CSR-04-1, School of Computer Science, University of Birmingham, Birmingham B15 2TT. United Kingdom, pp. 1–11 (2004)

    Google Scholar 

  4. Barker, C., Shan, C.-c.: Types as Graphs: Continuations in Type Logical Grammar. Journal of Logic, Language and Information 15(4), 331–370 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bekki, D.: Monads and Meta-Lambda Calculus. In: Hattori, H. (ed.) New Frontiers in Artificial Intelligence (JSAI 2008 Conference and Workshops, Asahikawa, Japan, Revised Selected Papers), June 2008. LNCS (LNAI), vol. 5447, pp. 193–208. Springer, Heidelberg (2009)

    Google Scholar 

  6. Danvy, O., Filinski, A.: Abstracting Control. In: LFP 1990, the 1990 ACM Conference on Lisp and Functional Programming, pp. 151–160 (1990)

    Google Scholar 

  7. Danvy, O., Filinski, A.: Representing control. Mathematical Structures in Computer Science 2(4) (1992)

    Google Scholar 

  8. de Groote, P.: Type raising, continuations, and classical logic. In: van Rooij, R., Stokhof, M. (eds.) The 13th Amsterdam Colloquium. Institute for Logic, Language and Computation, pp. 97–101. Universiteit van Amsterdam (2001)

    Google Scholar 

  9. Dybvig, R.K., Peyton-Jones, S., Sabry, A.: A Monadic Framework for Delimited Continuations. Journal of Functional Programming 17(6), 687–730 (2007)

    Article  MathSciNet  Google Scholar 

  10. Felleisen, M.: The Theory and Practice of First-Class Prompts. In: 15th ACM Symposium on Principles of Programming Languages, pp. 180–190 (1988)

    Google Scholar 

  11. Hayashishita, J.R.: ‘Syntactic Scope and Non-Syntactic Scope’. In: Doctoral dissertation, University of Southern California (2003)

    Google Scholar 

  12. Kratzer, A.: Scope or pseudoscope? Are there wide scope indefinites? In: Rothstein, S. (ed.) Events and Grammar, pp. 163–196. Kluwer, Dordrecht (1998)

    Chapter  Google Scholar 

  13. Otake, R.: Delimited continuation in the grammar of Japanese. Talk presented at Continuation Fest, Tokyo (2008)

    Google Scholar 

  14. Partee, B., Rooth, M.: Generalized conjunction and type ambiguity. In: Bauerle, R., Schwarze, C., Von Stechow, A. (eds.) Meaning, Use and Interpretation of Language, pp. 361–393. Walter De Gruyter Inc., Berlin (1983)

    Google Scholar 

  15. Plotkin, G.D.: Call-by-Name, Call-by Value and the Lambda Calculus. Theoretical Computer Science 1, 125–159 (1975)

    Article  MathSciNet  Google Scholar 

  16. Rooth, M.: A Theory of Focus Interpretation. Natural Language Semantics 1, 75–116 (1992)

    Article  Google Scholar 

  17. Shan, C.-c.: A continuation semantics of interrogatives that accounts for Baker’s ambiguity. In: Jackson, B. (ed.) Semantics and Linguistic Theory XII, Ithaca, pp. 246–265. Cornell University Press (2002)

    Google Scholar 

  18. Shan, C.-c.: Linguistic side effects. In: Barker, C., Jacobson, P. (eds.) Direct compositionality, pp. 132–163. Oxford University Press, Oxford (2007)

    Google Scholar 

  19. Shan, C.-c., Barker, C.: Explaining Crossover and Superiority as Left-to-right Evaluation. Linguistics and Philosophy 29(1), 91–134 (2006)

    Article  Google Scholar 

  20. Sitaram, D.: Handling Control. In: The ACM Conference on Programming Language Design and Implementation (PLDI 1993). ACM SIGPLAN Notices, vol. 28, pp. 147–155. ACM Press, New York (1993)

    Google Scholar 

  21. Sitaram, D., Felleisen, M.: Control delimiters and their hierarchies. LISP and Symbolic Computation 3(1), 67–99 (1990)

    Article  Google Scholar 

  22. Stratchey, C., Wadsworth, C.: ‘Continuations: a mathematical semantics for handling full jumps’. Technical report, Oxford University, Computing Laboratory (1974)

    Google Scholar 

  23. Wagner, M.: NPI-Licensing and Focus Movement. In: Georgala, E., Howell, J. (eds.) SALT XV, CLC Publications, Ithaca (2006)

    Google Scholar 

  24. Winter, Y.: Flexibility Principle in Boolean Semantics: coordination, plurality and scope in natural language. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Faculty of Science, Ochanomizu University, Ootsuka 2-1-1, Bunkyo-ku, Tokyo, Japan

    Daisuke Bekki & Kenichi Asai

Authors
  1. Daisuke Bekki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenichi Asai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SRA Inc., Key Technology Laboratory, 2-32-8 Minami-Ikebukuro, Toyoshima-Ku, 171-8513, Tokyo, Japan

    Kumiyo Nakakoji

  2. National Institute of Information and Communications Technology, 3-5 Hikaridai, Seika-cho, Soraku-gun, 619-0289, Kyoto, Japan

    Yohei Murakami

  3. Department of English, Aoyama Gakuin University, 4-4-25 Shibuya, Shibuya-ku, 150-8366, Tokyo, Japan

    Elin McCready

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bekki, D., Asai, K. (2010). Representing Covert Movements by Delimited Continuations. In: Nakakoji, K., Murakami, Y., McCready, E. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2009. Lecture Notes in Computer Science(), vol 6284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14888-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14888-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14887-3

  • Online ISBN: 978-3-642-14888-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation