Higher-order Linear Logic Programming of Categorial Deduction
classification
cmp-lg
cs.CL
keywords
categorialdeductionhigher-orderlambeklinearlogicparsingprogramming
read the original abstract
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing problem of Lambek categorial grammar applicable to a variety of its extensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.