6 search results - page 1 / 2 » Tree Adjoining Grammars in a Fragment of the Lambek Calculus |
COLING
1999
13 years 4 months ago
1999
LACL
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
ACL
1989
13 years 5 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
ACL
2006
13 years 6 months ago
2006
We claim that existing specification languages for tree based grammars fail to adequately support identifier managment. We then show that XMG (eXtensible MetaGrammar) provides a s...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...