ML p(r)ior | Higher-order Linear Logic Programming of Categorial Deduction
Processing...

Higher-order Linear Logic Programming of Categorial Deduction

1995-02-14
9502016 | cmp-lg
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.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations