Type-theoretical grammar
Journal of Functional Programming
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A datalog recognizer for almost affine λ-CFGs
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Hi-index | 0.00 |
This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation. It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, but also to a lambda term representing its semantics.