David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.
|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
Reinhard Muskens (2010). New Directions in Type-Theoretic Grammars. Journal of Logic, Language and Information 19 (2):129-136.
Similar books and articles
G. David Morley (2000). Syntax in Functional Grammar: An Introduction to Lexicogrammar in Systemic Linguistics. Continuum.
Jochen Dörre, Esther König & Dov Gabbay (1996). Fibred Semantics for Feature-Based Grammar Logic. Journal of Logic, Language and Information 5 (3-4):387-422.
Raffaella Bernardi (2004). Analyzing the Core of Categorial Grammar. Journal of Logic, Language and Information 13 (2):121-137.
Aravind K. Joshi & Seth Kulick (1997). Partial Proof Trees as Building Blocks for a Categorial Grammar. Linguistics and Philosophy 20 (6):637-667.
Added to index2009-01-28
Total downloads18 ( #91,421 of 1,098,834 )
Recent downloads (6 months)1 ( #286,314 of 1,098,834 )
How can I increase my downloads?