Skip to main content

The Calculus of Responsibility and Commitment

  • Chapter
Ludics, Dialogue and Interaction

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

  • 426 Accesses

Introduction

Ever since Montague (1974 [1970]) laid the foundations for formally precise analysis of natural language (hereafter NL) semantics in the late 1960’s, the typed lambda calculus (hereafter TLC) and certain of its extensions have been the linguists’ tool of choice for representing the meanings of NL expressions. But starting around the turn of the millenium, motivated by a range of linguistic phenomena collectively known as covert movement phenomena, logical grammarians of various persuasions have proposed the use of other semantic term calculi that embody, directly or indirectly, some notion or other of continuation.

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

  • Anoun, H., Lecomte, A.: Linear grammars with labels. Formal Grammar 2006 (2007)

    Google Scholar 

  • Bach, E., Partee, B.: Anaphora and semantic structure. In: Krieman, J., Ojeda, A. (eds.) Papers from the Parasession on Pronouns and Anaphora, pp. 1–28. Chicago Linguistic Society, Chicago (1980)

    Google Scholar 

  • Bach, E.: Discontinuous constituents in generalized categorial grammar. NELS 11, 1–22 (1981)

    Google Scholar 

  • Barker, C.: Continuations and the nature of quantification. Natural Language Semantics 10, 211–242 (2002)

    Article  Google Scholar 

  • Bernardi, R., Moortgat, M.: Continuation semantics for symmetric categorial grammar. In: Leivant, D., de Queiroz, R. (eds.), pp. 53–71 (2007)

    Google Scholar 

  • Blackburn, P., Bos, J.: Representation and Inference for Natural Language. CSLI, Stanford (2005)

    Google Scholar 

  • Carpenter, B.: A deductive account of scope. In: Proceeding of the Thirteenth West Coast Conference on Formal Linguistics, San Diego, CSLI, Stanford (1994)

    Google Scholar 

  • Carpenter, B.: Type-Logical Semantics. MIT Press, Cambridge (1997)

    MATH  Google Scholar 

  • Curien, P.-L., Herbelin, H.: The duality of computation. In: ICFP 2000, pp. 233–243 (2000)

    Google Scholar 

  • Church, A.: A formulation of a simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  • Cooper, R.: Montague’s Semantic Theory and Transformational Syntax. Ph.D. dissertation, University of Massachusetts at Amherst (1975)

    Google Scholar 

  • Cooper, R.: Quantification and Syntactic Theory. Reidel, Dordrecht (1983)

    Book  Google Scholar 

  • Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp. 151–160. ACM Press, New York (1990)

    Chapter  Google Scholar 

  • Felleisen, M.: The theory and practice of first-class prompts. In: POPL 1988, pp. 180–190. ACM Press, New York (1988)

    Google Scholar 

  • Fischer, M.: Lambda calculus schemata. In: Proceedings of the ACM Conference Proving Assertions about Programs. SIGPLAN Notices, SIGACT News, vol. 7(1), (14), pp. 104–109 (January 1972)

    Google Scholar 

  • Gazdar, G.: English as a context-free language. Unpublished manuscript dated April 1979, Cognitive Science Program, University of Sussex (1979)

    Google Scholar 

  • de Groote, P.: Type raising, continuations, and classical logic. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the Thirteenth Amsterdam Colloquium. Institute for Logic, Language, and Computation, Universiteit van Amsterdam, Amsterdam, pp. 97–101 (2001)

    Google Scholar 

  • Gallin, D.: Intensional and Higher Order Modal Logic. North-Holland, Amsterdam (1975)

    MATH  Google Scholar 

  • Hendriks, H.: Studied Flexibility: Categories and Types in Syntax and Semantics. Ph.D. dissertation, Universiteit van Amsterdam (1993)

    Google Scholar 

  • Henkin, L.: Completeness in the theory of types. Journal of Symbolic Logic 15, 81–91 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  • Keller, W.: Nested Cooper storage: the proper treatment of quantification in ordinary noun phrases. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp. 432–447. Reidel, Dordrecht (1988)

    Chapter  Google Scholar 

  • Leivant, D., de Queiroz, R. (eds.): WoLLIC 2007. LNCS, vol. 4576. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  • Montague, R.: The proper treatment of quantification in ordinary English. In: Thomason, R. (ed.) Formal Philosophy: Selected Papers of Richard Montague, pp. 247–270. Yale University Press, New Haven (1974)

    Google Scholar 

  • Moortgat, M.: Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus. Ph.D. dissertation, Universiteit van Amsterdam. Foris, Dordrecht (1988)

    Google Scholar 

  • Moortgat, M.: Generalized quantifiers and discontinuous type constructors. In: Bunt, H., van Horck, A. (eds.) Discontinuous Constituency, pp. 181–207. De Gruyter, Berlin (1996)

    Google Scholar 

  • Moortgat, M.: Symmetries in natural language syntax and semantics. In: Leivant, D., de Queiroz, R. (eds.), pp. 264–268 (2007)

    Google Scholar 

  • Morrill, G.: Type Logical Grammar: Categorial Logic of Signs. Kluwer, Dordrecht (1994)

    Book  MATH  Google Scholar 

  • Parigot, M.: λμ-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  • Parigot, M.: On the computational interpretation of negation. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 472–484. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  • Plotkin, G.: Call-by-name, call-by-value, and the λ-calculus. Theoretical Computer Science 1(2), 125–159 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  • Pollard, C.: Nonlocal dependencies via variable contexts. In: Muskens, R. (ed.) Workshop on New Directions in Type-Theoretic Grammar. ESSLLI 2007, Dublin. Revised and extended version under review for a special issue of Journal of Logic, Language, and Information (2007)

    Google Scholar 

  • Pollard, C.: Covert movement in logical grammar. In: Pogodalla, S., Quatrini, M., Retoré, C. (eds.) Logic and Grammar: Essays Presented to Alain Lecomte on the Occasion of his 60th Birthday. LNCS/FOLLI (in press)

    Google Scholar 

  • Shan, C.-c.: Delimited continuations in natural language: quantification and polar sensitivity. In: Continuation Workshop 2004, Venice (2004)

    Google Scholar 

  • Stabler, E.: Remnant movement and structural complexity. In: Bouma, G., Hinrichs, E., Kruiff, G.-J., Oehrle, R. (eds.) Constraints and Resources in Natural Language, CSLI, Stanford (1999)

    Google Scholar 

  • Vermaat, W.: Controlling Movement: Minimalism in a Deductive Perspective. Master’s thesis, Utrecht University (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pollard, C. (2011). The Calculus of Responsibility and Commitment. In: Lecomte, A., Tronçon, S. (eds) Ludics, Dialogue and Interaction. Lecture Notes in Computer Science(), vol 6505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19211-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19211-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19210-4

  • Online ISBN: 978-3-642-19211-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics