Higher-order Linear Logic Programming of Categorial Deduction
<|reference_start|>Higher-order Linear Logic Programming of Categorial Deduction: 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.<|reference_end|>
@article{morrill1995higher-order,
    title={Higher-order Linear Logic Programming of Categorial Deduction},
    author={Glyn Morrill},
    journal={arXiv preprint arXiv:cmp-lg/9502016},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9502016},
    primaryClass={cmp-lg cs.CL}
}