Higher-order Linear Logic Programming of Categorial Deduction
cmp-lg
2016-08-31 v2 计算与语言
摘要
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.
引用
@article{arxiv.cmp-lg/9502016,
title = {Higher-order Linear Logic Programming of Categorial Deduction},
author = {Glyn Morrill},
journal= {arXiv preprint arXiv:cmp-lg/9502016},
year = {2016}
}
备注
8 pages LaTeX, uses eaclap.sty, to appear EACL95