The Penn lambda calculator: Pedagogical software for natural language semantics
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
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 modiﬁcation, and lambda abstraction. This includes phenomena such as intersective adjectives, relative clauses and quantiﬁer 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 speciﬁc, interactive suggestions.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Reinhard Muskens (2010). New Directions in Type-Theoretic Grammars. Journal of Logic, Language and Information 19 (2):129-136.
Sean A. Fulop (2005). Semantic Bootstrapping of Type-Logical Grammar. Journal of Logic, Language and Information 14 (1):49-86.
Steve Awodey (2000). Topological Representation of the Lambda-Calculus. Mathematical Structures in Computer Science 10 (1):81-96.
Chris Fox (2005). Foundations of Intensional Semantics. Blackwell Pub..
H. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
William J. Rapaport (1988). Syntactic Semantics: Foundations of Computational Natural Language Understanding. In James H. Fetzer (ed.), Aspects of AI. Kluwer
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.
William J. Rapaport (1993). Because Mere Calculating Isn't Thinking: Comments on Hauser's Why Isn't My Pocket Calculator a Thinking Thing?. Minds and Machines 3 (1):11-20.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
Added to index2009-01-28
Total downloads2 ( #682,629 of 1,796,321 )
Recent downloads (6 months)0
How can I increase my downloads?