On the membership problem for non-linear abstract categorial grammars
From MaRDI portal
Publication:972435
Recommendations
- A note on the complexity of abstract categorial grammars
- Logical Aspects of Computational Linguistics
- A faithful representation of non-associative Lambek grammars in abstract categorial grammars
- Abstract categorial parsing as linear logic programming
- A polynomial algorithm for the membership problem with categorial grammars
Cites work
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 700345 (Why is no real title available?)
- scientific article; zbMATH DE number 1984520 (Why is no real title available?)
- scientific article; zbMATH DE number 1361533 (Why is no real title available?)
- A coherence theorem for canonical morphisms in Cartesian closed categories
- On multiple context-free grammars
- The IO- and OI-hierarchies
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The typed lambda-calculus is not elementary recursive
- Tree adjunct grammars
- Uniqueness of normal proofs in implicational intuitionistic logic
Cited in
(8)- A Datalog recognizer for almost affine -CFGs
- Game semantics and uniqueness of type inhabitance in the simply-typed -calculus
- The IO and OI hierarchies revisited
- An alternate proof of Statman's finite completeness theorem
- A note on the complexity of abstract categorial grammars
- scientific article; zbMATH DE number 4045723 (Why is no real title available?)
- The IO and OI hierarchies revisited
- A polynomial algorithm for the membership problem with categorial grammars
This page was built for publication: On the membership problem for non-linear abstract categorial grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972435)