Abstract
The attraction of Categorial Grammar (CG) as a notation for natural language grammar has always been the direct relation that it embodies between the syntax of a language and an applicative semantics. Common sense suggests that just such a relation should hold for natural languages, just as it does in the systems of logic which gave rise to CG in the first place. However, the existence of discontinuous constituents, extractions, and all the other phenomena whose importance was first and most clearly exposed by Chomsky (1957) makes it clear that something more is required than the basic ingredients of function and argument categories, plus functional application, prescribed by Ajdukiewicz (1935). Those who have attempted to cope with these phenomena within CG have proposed to ‘generalise’ (Bach, 1983) or ‘extend’ (Levin, 1982) the basic context-free apparatus by the addition of various operations on the functions and arguments, over and above simple functional application. These additions have included functional composition and type raising (Lambek, 1958, 1961; Geach, 1972), ‘wrapping’ (Bach, 1979, 1980), and some others.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ades, Anthony E. and Mark J. Steedman: 1982, ‘On the Order of Words’, Linguistics and Philosophy 4, 517–558.
Ajdukiewicz, Kazimierz: 1935, ‘Die syntaktische Konnexität’, Studia Philosophica 1, 1–27. English translation in: Polish Logic 1920–1939, ed. by Storrs McCall, Oxford University Press, pp. 207–231.
Bach, Emmon: 1979, ‘Control in Montague Grammar’, Linguistic Inquiry 10, 515–531.
Bach, Emmon: 1980, ‘In Defense of Passive’, Linguistics and Philosophy 3, 297–341.
Bach, Emmon: 1983, ‘Generalised Categorial Grammars and the English Auxiliary’, Linguistic Categories, Auxiliaries, and Related Puzzles, II, ed. by Frank Heny and Barry Richards, Reidel, Dordrecht, pp. 101–120.
Barendregt, Hendrik Pieter: 1981, The Lambda Calculus, North Holland, Amsterdam.
Bar-Hillel, Yehoshua: 1953, ‘A Quasi-arithmetical Notation for Syntactic Description’, Language 29, 47–58.
Bar-Hillel, Yehoshua, C. Gaifman, and E. Shamir: 1960, ‘On Categorial and Phrase Structure Grammars’, The Bulletin of the Research Council of Israel 9F, 1–16. Reprinted in: Language and Information, ed. by Yehoshua Bar-Hillel, Addison-Wesley, Reading MA, 1964, pp. 99–115.
Brame, Michael K: 1976, Conjectures and Refutations in Syntax, Elsevier North Holland, New York.
Bresnan, Joan W.: 1978, ‘A Realistic Transformational Grammar’, Linguistic Structure and Psychological Reality, ed. by Morris Hall, Joan W. Bresnan, and George A. Miller, MIT Press, Cambridge, MA.
Bresnan, Joan W.: 1982, The Mental Representation of Grammatical Relations, MIT Press, Cambridge, Mass.
Buneman, Peter, Robert E. Frankel, and Rishiyur Nikhil: 1982, ‘An Implementation Technique for Database Query Languages’, ACM Transactions on Database Systems 7 (2), 164–186.
Burge, William H.: 1975, Recursive Programming Techniques, Addison-Wesley, Reading, MA.
Chomsky, Noam: 1957, Syntactic Structures, Mouton, The Hague.
Curry, Haskell B.: 1961, ‘Some Logical Aspects of Grammatical Structure. Structure of Language and Its Mathematical Aspects’, Proceedings of the Symposia in Applied Mathematics XII, 56–68, American Mathematical Society, Providence, Rhode Island.
Curry, Haskell B. and Robert Feys: 1958, Combinatory Logic, Vol. I, North Holland, Amsterdam.
Dowty, David: 1982, ‘Grammatical Relations and Montague Grammar’, The Nature of Syntactic Representation, ed. by Pauline Jacobson and Geoffrey K. Pullum, Reidel, Dordrecht, pp. 79–130.
Dowty, David: 1987, Type Raising, Functional Composition, and Non-constituent Coordination, Paper to the Conference on Categorial Grammar, Tucson, AZ, June 1985. ( This volume. )
Engdahl, Elisabet: 1981, ‘Multiple Gaps in English and Swedish’, Proceedings of the 6th Scandanavian Conference of Linguistics, ed. by Torsten Fretheim and Lars Hellan, Tapir, Trondheim.
Engdahl, Elisabet: 1983, ‘Parasitic Gaps’, Linguistics and Philosophy 6, 5–34.
Feys, Robert and Frederic B. Fitch: 1969, Dictionary of Symbols of Mathematical Logic, North Holland, Amsterdam.
Gazdar, Gerald: 1981, ‘Unbounded Dependencies and Coordinate Structure’, Linguistic Inquiry 12, 155–184.
Gazdar, Gerald: 1982, ‘Phrase Structure Grammar’, The Nature of Syntactic Representation, ed. by Pauline Jacobson and Geoffrey K. Pullum, Reidel, Dordrecht, pp. 131–186.
Gazdar, Gerald, Ewan Klein, Ivan A. Sag, and Geoffrey K. Pullum: 1985, Generalised Phrase Structure Grammar, Blackwell, Oxford.
Geach, Peter T.: 1972, ‘A Program for Syntax’, Semantics of Natural Language, ed. By Donald Davidson and Gilbert Harman, Reidel, Dordrecht, pp. 483–497.
Hindley, J. R. B. Lercher, and J. P. Seldin: 1972, Introduction to Combinatory Logic, Cambridge University Press, Cambridge.
Hughes, R. J. M.: 1982. M.: 1982, ‘Supercombinators: A New Implementation Method for Applicative Languages’, Proceedings of the ACM Conference on Lisp and Functional Programming, August 1982.
Jowsey, Einar: 1984, Argument Crossover in Categorial Grammar, Working paper, Dept. of A. I., University of Edinburgh.
Kaplan, David: 1975, ‘How to Russell a Frege-Church’, Journal of Philosophy 72, 716–729.
Kayne, Richard S.: 1981, ‘ECP Extensions’, Linguistic Inquiry 12, 93–133.
Kayne, Richard S.: 1983, ‘Connectedness’, Linguistic Inquiry 14, 223–249.
Keenan, Edward and Leonard Faltz: 1978, ‘Logical Types for Natural Language’, UCLA Occasional Papers in Linguistics 3.
Klein, Ewan and Ivan A. Sag: 1984, ‘Type-driven Translation’, Linguistics and Philosophy,in press.
Lambek, Joachim: 1958, ‘The Mathematics of Sentence Structure’, American Mathematical Monthly 65, 154–170.
Lambek, Joachim: 1961, ‘On the Calculus of Syntactic Types. Structure of Language and Its Mathematical Aspects’, Proceedings of the Symposia in Applied Mathematics XII, 166–178, American Mathematical Society, Providence, Rhode Island.
Lewis, D.: 1972, ‘General Semantics’, in D. Davidson and G. Harman (eds.), Semantics of Natural Language,Reidel, Dordrecht, pp. 169–218.
Montague, Richard: 1970, ‘Universal Grammar’, Theoria 36, 373–398. Reprinted in: Formal Philosophy: Papers of Richard Montague, ed. by Richmond H. Thomason, Yale University Press, New Haven, 1974, pp. 247–279.
Montague, Richard: 1973, ‘The Proper Treatment of Qua.-tification in Ordinary English’, Approaches to Natural Language: Proceedings of the 1970 Stanford Workshop on Grammar and Semantics, ed. by Jaakko Hintikka, J. Moravcsik, and P. Suppes, Reidel, Dordrecht, pp. 221–242. Reprinted in: Formal Philosophy: Papers of Richard Montague, ed. by Richmond H. Thomason, Yale University Press, New Haven, 1974, pp. 247–279.
Moortgat, Michael: 1983, ‘A Fregean Restriction on Metarules’, Proceedings of the Fourteenth Annual Meeting of the North Eastern Linguistics Society, ed. by Peter Sells and Charles Jones, Graduate Linguistic Student Association, Amherst, MA, pp. 306–325.
Peyton-Jones, S. L.: 1984, ‘Directions in Functional Programming Research’, Distributed Computing Systems Programme, ed. by D. A. Duce, pp. 220–249.
Pollard, Carl: 1985, Lectures on HPSG, Ms, Stanford University.
Shaumyan, S. K.: 1977, Applicational Grammar as a Semantic Theory of Natural Language, Edinburgh University Press, Edinburgh.
Schönfinkel, Moses: 1924, ‘Über die Bausteine der Mathematischen Logik’, Mathematische Annalen 92, 305–316.
Steedman, Mark J.: 1985a, ‘Dependency and Coordination in the Grammar of Dutch and English’, Language 61, 523–568.
Steedman, Mark J.: 1987a, ‘Combinatory Grammars and Parasitic Gaps’, Natural Language and Linguistic Theory 5.4.
Steedman, Mark J.: 1987b, ‘Combinatory Grammars and Human Language Processing’, Paper to conference on Modularity in Knowledge Representation, Amherst June 1985. In J. Garfield (ed.), Modularity in Knowledge Representation and Natural Language Processing, MIT Press/Bradford: Cambridge MA, 187–205.
Stenlund, Sören: 1972, Combinators, A-terms and Proof Theory, Reidel, Dordrecht.
Stoye, William R, T J W Clarke, and A. C. Norman: 1984, ‘Some Practical Methods for Rapid Combinator Reduction’, Proceedings of the ACM Conference on Lisp and Functional Programming, Austin TX, August 1984, pp. 159–166.
Szabolcsi, Anna: 1983, ECP in Categorial Grammar, Ms, Max Planck Institute, Nijmegen.
Taraldsen, Tarald: 1979, ‘The Theoretical Interpretation of a Class of Marked Extractions’, Theory of Markedness in Generative Grammar, ed. by A. Belletti, L. Brandi, and L. Rizzi, Scuole Normale Superiore di Pisa, Pisa.
Turner, David A.: 1979a, ‘A New Implementation Technique for Applicative Languages’, Software — Practice and Experience 9, 31–49.
Turner, David A.: 1979b, ‘Another Algorithm for Bracket Abstraction’, Journal of Symbolic Logic 44, 267–270.
Williams, Edwin, S.: 1978, ‘Across-the board Rule Application’, Linguistic Inquiry 9, 31–43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Steedman, M. (1988). Combinators and Grammars. In: Oehrle, R.T., Bach, E., Wheeler, D. (eds) Categorial Grammars and Natural Language Structures. Studies in Linguistics and Philosophy, vol 32. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-6878-4_15
Download citation
DOI: https://doi.org/10.1007/978-94-015-6878-4_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-55608-031-9
Online ISBN: 978-94-015-6878-4
eBook Packages: Springer Book Archive