Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
Journal of Logic, Language and Information
Generation, Lambek calculus, Montague's semantics and semantic proof nets
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
New Directions in Type-Theoretic Grammars
Journal of Logic, Language and Information
On the Membership Problem for Non-Linear Abstract Categorial Grammars
Journal of Logic, Language and Information
Towards a Type-Theoretical Account of Lexical Semantics
Journal of Logic, Language and Information
The IO and OI hierarchies revisited
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed λ-terms. Among significant results, an efficient algorithm based on Datalog programming is presented in [Kan07] for context-free grammar of almost linear λ-terms, which are linear λ-terms augmented with a restricted form of copy. We present an extension of this method to terms for which deletion is allowed.