Penn, G., 1996. An LF Implementation of Gentzen's Theorem for Lambek Categorial Grammar. Technical Report, School for Computer Science, Carnegie Mellon University. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the Connection between Context-Free Grammars and Lambek.. - Penn (1996) Self-citation (Penn) (Correct)
....that L(G) L( G) which follows from two more general theorems. Theorem 3 Given a CFG, G, symbols X,X 1 , X n , category B, and non terminals N 1 ; N q , if X ) G X 1 . X n , then if B = X, an induced cate3 The present proof can also be conducted in the sequent formulation [20]. 7 gory of X, then there exist X 1 ; X n such that: u 1 X 1 Delta Delta Delta u n X n D X Proof: The inclusion, L(G) L( G) directly follows from this theorem. In this abstract, I will present only a few cases, along with their implementations. The proof is by induction on ....
....an insight into the complexity of 10 parsing with Categorial Grammars. A similar representation can be used to represent sequent style derivations in LCG, an equivalence proof between the sequent and natural deduction style calculi for LCG s, and a proof of the cut elimination theorem for LCG s [20]. LF and Elf have proven to be valuable tools for reasoning about higher order objects and proofs in this domain; and have proven to be capable of bearing fruit for research not only in Categorial Grammar, but in substructural logics in general, to which the representation given here can easily be ....
Penn, G., 1996. An LF Implementation of Gentzen's Theorem for Lambek Categorial Grammar. Technical Report, School for Computer Science, Carnegie Mellon University.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC