Higher-order Linear Logic Programming of Categorial Deduction

Details Higher-order Linear Logic Programming of Categorial Deduction Higher-order Linear Logic Programming of Categorial Deduction

1995-02-14

arxiv.org/abs/cmp-lg/9502016v2

Computer Science

Computation and Language

8 pages LaTeX, uses eaclap.sty, to appear EACL95

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Higher-order Linear Logic Programming of Categorial Deduction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Higher-order Linear Logic Programming of Categorial Deduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Higher-order Linear Logic Programming of Categorial Deduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106159