The Penn lambda calculator: Pedagogical software for natural language semantics

Abstract

This paper describes a novel pedagogical software program that can be seen as an online companion to one of the standard textbooks of formal natural language semantics, Heim and Kratzer (1998). The Penn Lambda Calculator is a multifunctional application designed for use in standard graduate and undergraduate introductions to formal semantics: Teachers can use the application to demonstrate complex semantic derivations in the classroom and modify them interactively, and students can use it to work on problem sets provided by the teacher. The program supports demonstrations and exercises in two main areas: (1) performing beta reduction in the simply typed lambda calculus; (2) application of the bottom-up algorithm for computing the compositional semantics of natural language syntax trees. The program is able to represent the full range of phenomena covered in the Heim and Kratzer textbook by function application, predicate modification, and lambda abstraction. This includes phenomena such as intersective adjectives, relative clauses and quantifier raising. In the student use case, emphasis has been placed on providing “live” feedback for incorrect answers. Heuristics are used to detect the most frequent student errors and to return specific, interactive suggestions.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Nominalization, predication and type containment.Fairouz Kamareddine & Ewan Klein - 1993 - Journal of Logic, Language and Information 2 (3):171-215.
Natural language semantics: formation and valuation.Brendan S. Gillon - 2019 - Cambridge, Massachussetts: The MIT Press.
Domains and lambda-calculi.Roberto M. Amadio - 1998 - New York: Cambridge University Press. Edited by P.-L. Curien.
Mathematical Methods in Linguistics.Barbara Partee, Alice ter Meulen & Robert Wall - 1987 - Boston, MA, USA: Kluwer Academic Publishers.
Upper Bounds for Standardizations and an Application.Hongwei Xi - 1999 - Journal of Symbolic Logic 64 (1):291-303.
Typed logics with states.J. van Eijck - 1997 - Logic Journal of the IGPL 5 (5):623-645.
Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.

Analytics

Added to PP
2009-01-28

Downloads
2 (#1,921,051)

6 months
2 (#1,359,420)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

No references found.

Add more references