Proofs and types
On multiple context-free grammars
Theoretical Computer Science
Finite model theory in the simply typed lambda calculus
Finite model theory in the simply typed lambda calculus
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
Journal of Logic, Language and Information
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer and System Sciences
Game semantics and uniqueness of type inhabitance in the simply-typed λ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
A datalog recognizer for almost affine λ-CFGs
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
An alternate proof of Statman's finite completeness theorem
Information Processing Letters
Two-level game semantics, intersection types, and recursion schemes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
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 |
In this paper we show that the membership problem for second order non-linear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of 驴-terms and presents an interest in its own.