\begin{thebibliography}{10}

\bibitem{ades-steedman}
Anthony~E. Ades and Mark~J. Steedman.
\newblock On the order of words.
\newblock {\em Linguistics and Philosophy}, 4(4):517--558, 1982.

\bibitem{cle}
Hiyan Alshawi, editor.
\newblock {\em The Core Language Engine}.
\newblock ACL-MIT Press Series in Natural Language Processing. MIT Press,
  Cambridge, Massachusetts, 1992.

\bibitem{Bancilhon+Ramakrishnan:amateur}
Fran\c{c}ois Bancilhon and Raghu Ramakrishnan.
\newblock An amateur's introduction to recursive query processing strategies.
\newblock In Michael Stonebraker, editor, {\em Readings in Database Systems},
  section 8.2, pages 507--555. Morgan Kaufmann, San Mateo, California, 1988.

\bibitem{Billot+Lang:shared}
Sylvie Billot and Bernard Lang.
\newblock The structure of shared forests in ambiguous parsing.
\newblock In {\em Proceedings of the 27th Annual Meeting of the Association for
  Computational Linguistics}, pages 143--151, Vancouver, British Columbia,
  26-29 June 1989.

\bibitem{Bresnan+Kaplan:lfg}
Joan Bresnan and Ron Kaplan.
\newblock Lexical-functional grammar: A formal system for grammatical
  representation.
\newblock In J.~Bresnan, editor, {\em The Mental Representation of Grammatical
  Relations}, pages 173--281. {MIT} Press, 1982.

\bibitem{Carpenter:logic}
Bob Carpenter.
\newblock {\em The Logic of Typed Feature Structures}.
\newblock Number~32 in Cambridge Tracts in Theoretical Computer Science.
  Cambridge University Press, Cambridge, England, 1992.

\bibitem{Colmerauer:mgs}
Alain Colmerauer.
\newblock Metamorphosis grammars.
\newblock In Leonard Bolc, editor, {\em Natural Language Communication with
  Computers}, pages 133--187. Springer-Verlag, 1978.
\newblock First appeared as ``Les Grammaires de Metamorphose'', Groupe
  d'Intelligence Artificielle, Universit\'{e} de Marseille II, November 1975.

\bibitem{e70}
Jay~C. Earley.
\newblock An efficient context-free parsing algorithm.
\newblock {\em Communications of the ACM}, 13(2):94--102, 1970.

\bibitem{Hodas:gaps}
Joshua~S. Hodas.
\newblock Specifying filler-gap dependency parsers in a linear-logic
  programming language.
\newblock In Krzysztof Apt, editor, {\em Proceedings of the Joint International
  Conference and Symposium on Logic Programming}, pages 622--636, Washington,
  DC, 1992.

\bibitem{j83}
Aravind~K. Joshi.
\newblock How much context-sensitivity is necessary for characterizing
  structural descriptions---{Tree} adjoining grammars.
\newblock In D.~Dowty, L.~Karttunen, and A.~Zwicky, editors, {\em Natural
  Language Processing---{Theoretical}, Computational and Psychological
  Perspectives}. Cambridge University Press, New York, 1985.

\bibitem{jlt75}
Aravind~K. Joshi, L.~S. Levy, and M.~Takahashi.
\newblock Tree adjunct grammars.
\newblock {\em Journal of Computer and System Sciences}, 10(1):136--163, 1975.

\bibitem{ka65}
T.~Kasami.
\newblock An efficient recognition and syntax algorithm for context-free
  languages.
\newblock Technical Report AF-CRL-65-758, Air Force Cambridge Research
  Laboratory, Bedford, Massachusetts, 1965.

\bibitem{kay-chart-parsing}
Martin Kay.
\newblock Algorithm schemata and data structures in syntactic processing.
\newblock In Barbara~J. Grosz, Karen~Sparck Jones, and Bonnie~Lynn Webber,
  editors, {\em Readings in Natural Language Processing}, chapter I.~4, pages
  35--70. Morgan Kaufmann, Los Altos, California, 1986.
\newblock Originally published as a Xerox PARC technical report, 1980.

\bibitem{kj85}
Anthony Kroch and Aravind~K. Joshi.
\newblock Linguistic relevance of tree adjoining grammars.
\newblock Technical Report MS-CIS-85-18, Department of Computer and Information
  Science, University of Pennsylvania, Philadelphia, Pennsylvania, April 1985.

\bibitem{Lambek:sentstruct}
Joachim Lambek.
\newblock The mathematics of sentence structure.
\newblock {\em American Mathematical Monthly}, 65:154--170, 1958.

\bibitem{Lang:74}
Bernard Lang.
\newblock Deterministic techniques for efficient non-deterministic parsers.
\newblock In J.~Loeckx, editor, {\em Proceedings of the 2nd Colloquium on
  Automata, Languages and Programming}, pages 255--269, Saarbr{\"{u}}cken,
  Germany, 1974. Springer-Verlag.

\bibitem{Lassez+al:revisited}
Jean-Louis Lassez, Michael~J. Maher, and Kim~G. Marriot.
\newblock Unification revisited.
\newblock In Jack Minker, editor, {\em Foundations of Deductive Databases and
  Logic Programming}, pages 587--625, San Mateo, California, 1988. Morgan
  Kaufmann.

\bibitem{Moortgat:categorial}
Michael Moortgat.
\newblock {\em Categorial Investigations: Logical and Linguistic Aspects of the
  {Lambek} Calculus}.
\newblock PhD thesis, University of Amsterdam, Amsterdam, The Netherlands,
  October 1988.

\bibitem{Naughton+Ramakrishnan:bottom-up}
Jeffrey~F. Naughton and Raghu Ramakrishnan.
\newblock Bottom-up evaluation of logic programs.
\newblock In Jean-Louis Lassez and Gordon Plotkin, editors, {\em Computational
  Logic: Essays in Honor of Alan Robinson}, chapter~20, pages 641--700. MIT
  Press, Cambridge, Massachusetts, 1991.

\bibitem{Pareschi+Miller:ICLP90}
Remo Pareschi and Dale~A. Miller.
\newblock Extending definite clause grammars with scoping constructs.
\newblock In David H.~D. Warren and Peter Szeredi, editors, {\em Seventh
  International Conference on Logic Programming}, Jerusalem, Israel, 1990.
  {MIT} Press.

\bibitem{xtag92}
Patrick Paroubek, Yves Schabes, and Aravind~K. Joshi.
\newblock {XTAG} --- a graphical workbench for developing tree-adjoining
  grammars.
\newblock In {\em Proceedings of the Third Conference on Applied Natural
  Language Processing}, pages 216--223, Trento, Italy, 1992.

\bibitem{Pentus93}
M.~Pentus.
\newblock Lambek grammars are context free.
\newblock In {\em Proceedings of the Eighth Annual IEEE Symposium on Logic in
  Computer Science}, pages 429--433, Montreal, Canada, 19--23 June 1993. IEEE
  Computer Society Press.

\bibitem{Pereira+Warren:DCGs}
Fernando C.~N. Pereira and David H.~D. Warren.
\newblock Definite clause grammars for language analysis---a survey of the
  formalism and a comparison with augmented transition networks.
\newblock {\em Artificial Intelligence}, 13:231--278, 1980.

\bibitem{Pereira+Warren:ED}
Fernando C.~N. Pereira and David H.~D. Warren.
\newblock Parsing as deduction.
\newblock In {\em Proceedings of the 21st Annual Meeting of the Association for
  Computational Linguistics}, pages 137--144, Cambridge, Massachusetts, June
  15--17 1983.

\bibitem{Ramakrishan:templates}
Raghu Ramakrishnan.
\newblock Magic templates: A spellbinding approach to logic programs.
\newblock In Robert~A. Kowalski and Kenneth~A. Bowen, editors, {\em Logic
  Programming: Proceedings of the Fifth International Conference and
  Symposium}, pages 140--159, Seattle, Washington, 1988. {MIT} Press.

\bibitem{Ramakrishnan+al:coral}
Raghu Ramakrishnan, Divesh Srivastava, and S.~Sudarshan.
\newblock {CORAL}: {C}ontrol, {R}elations and {L}ogic.
\newblock In {\em Procs.\ of the International Conf.\ on Very Large Databases},
  1992.

\bibitem{Rounds+Manaster-Ramer:fg}
William~C. Rounds and Alexis Manaster-Ramer.
\newblock A logical version of functional grammar.
\newblock In {\em Proceedings of the 25th Annual Meeting of the Association for
  Computational Linguistics}, pages 89--96, Stanford, California, 1987.
  Stanford University.

\bibitem{Sato+Tamaki:patterns}
Taisuke Sato and Hisao Tamaki.
\newblock Enumeration of success patterns in logic programs.
\newblock {\em Theoretical Computer Science}, 34:227--240, 1984.

\bibitem{schabes-ci94}
Yves Schabes.
\newblock Left to right parsing of lexicalized tree-adjoining grammars.
\newblock {\em Computational Intelligence}, 1994.
\newblock To appear.

\bibitem{ss92a}
Yves Schabes and Stuart Shieber.
\newblock An alternative conception of tree-adjoining derivation.
\newblock In {\em Proceedings of the 20th Annual Meeting of the Association for
  Computational Linguistics}, pages 167--176, 1992.

\bibitem{schabes93}
Yves Schabes and Richard~C. Waters.
\newblock Lexicalized context-free grammars.
\newblock In {\em Proceedings of the 21st Annual Meeting of the Association for
  Computational Linguistics}, pages 121--129, Columbus, Ohio, June 1993.

\bibitem{sw-TR-94-13}
Yves Schabes and Richard~C. Waters.
\newblock Tree insertion grammar: A cubic-time parsable formalism that strongly
  lexicalizes context-free grammar.
\newblock Technical Report 94-13, Mitsubishi Electric Research Laboratories,
  Cambridge, Massachusetts, 1994.

\bibitem{Shieber:criteria}
Stuart~M. Shieber.
\newblock Criteria for designing computer facilities for linguistic analysis.
\newblock {\em Linguistics}, 23:189--211, 1985.

\bibitem{Shieber:restriction}
Stuart~M. Shieber.
\newblock Using restriction to extend parsing algorithms for
  complex-feature-based formalisms.
\newblock In {\em Proceedings of the 23rd Annual Meeting of the Association for
  Computational Linguistics}, pages 145--152, Chicago, Illinois, 1985.
  University of Chicago.

\bibitem{Shieber:inference}
Stuart~M. Shieber.
\newblock {\em Constraint-Based Grammar Formalisms}.
\newblock {MIT} Press, Cambridge, Massachusetts, 1992.

\bibitem{v87}
K.~Vijay-Shanker.
\newblock {\em A Study of Tree Adjoining Grammars}.
\newblock PhD thesis, Department of Computer and Information Science,
  University of Pennsylvania, Philadelphia, Pennsylvania, 1987.

\bibitem{vw93}
K.~Vijay-Shanker and David~J. Weir.
\newblock Parsing some constrained grammar formalisms.
\newblock {\em Computational Linguistics}, 19(4):591--636, December 1993.

\bibitem{y67}
D.~H. Younger.
\newblock Recognition and parsing of context-free languages in time $n^3$.
\newblock {\em Information and Control}, 10(2):189--208, 1967.

\end{thebibliography}
