Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logical Aspects of Computational Linguistics

LACL 2005: Logical Aspects of Computational Linguistics pp 101–113Cite as

Lambek-Calculus with General Elimination Rules and Continuation Semantics

  • Conference paper

  • 448 Accesses

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

Abstract

In modern approaches to proof-theory (e.g.,[8]) natural-deduction (ND) proof systems are presented with general elimination-rules (GE-rules) [10], derived from a more general (re)formulation of Prawitz’s inversion principle [13]. The setting of such enterprises are usually intuitionistic (and occasionally classic), but also linear [7] propositional calculi.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

  2. Barker, C.: Continuation in natural language. In: Thielecke, H. (ed.) Proceedings of the Fourth ACM SIGPLAN Continuations Workshop, CW 2004 (2004)

    Google Scholar 

  3. de Groote, P.: Type raising, continuations, and classical logic. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the thirteenth Amsterdam Colloquium, pp. 97–101. ILLC, Amsterdam (2001)

    Google Scholar 

  4. Joachimski, F., Matthes, R.: Short proofs of normalization for a lambda calculus, permutative conversions and Gödel’s T. Archives for Mathematical Logic 42(1), 59–87 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lambek, J.: The mathematics of sentence structure. Amer. Math. monthly 65, 154–170 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  6. Moortgat, M.: Categorial type logics. In: van Benthemand, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 93–178. North Holland, Amsterdam (1997)

    Chapter  Google Scholar 

  7. Negri, S.: Varieties of linear calculi. J. of Phil. Logic 32(6), 569–590 (2002)

    Article  MathSciNet  Google Scholar 

  8. Negri, S., Von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  9. Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science 11, 511–540 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Von Plato, J.: Natural deduction with general elimination rules. Archive Mathematical Logic 40, 541–567 (2001)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Polakow, J., Pfenning, F.: Natural deduction for intuitionistic non-commutative linear logic. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 295–309. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Prawitz, D.: Natural Deduction: Proof-Theoretical Study. Almqvist and Wicksell, Stockholm (1965)

    MATH  Google Scholar 

  14. Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J. (ed.) Proc. 2nd Scandinavian Symposium, North-Holland, Amsterdam (1971)

    Google Scholar 

  15. Steedman, M.: The Syntactic Process. MIT Press, Cambridge (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science dept., Technion-IIT, Haifa, Israel

    Nissim Francez

Authors
  1. Nissim Francez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LPL-CNRS, Université de Provence, 29 Avenue Robert Schuman, P.O. Box, 13621, Aix-en-Provence, France

    Philippe Blache

  2. Linguistics Dept., UCLA, Box 951543, 90095-1542, Los Angeles, CA, USA

    Edward Stabler

  3. ERSS, Université Bordeaux 3, CNRS, Domaine Universitaire, 33607, Pessac Cedex, France

    Joan Busquets

  4. LaBRI, Université Bordeaux 1, CNRS, 351, Cours de la Libération, 33405, Talence Cedex, France

    Richard Moot

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Francez, N. (2005). Lambek-Calculus with General Elimination Rules and Continuation Semantics. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_7

Download citation

  • DOI: https://doi.org/10.1007/11422532_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation