Higher-order Linear Logic Programming of Categorial Deduction

1995/02/14 by Glyn Morrill, Morrill, Glyn
Computer Science · #Advanced Algebra and Logic #Computation and Language (cs.CL) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems

paper · doi:10.48550/arxiv.cmp-lg/9502016

openalex publication_date 1995/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Formalized Lambek Calculus in Higher Order Logic (HOL4)
• The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
• First order linear logic and tensor type calculus for categorial grammars
• Comparing and evaluating extended Lambek calculi
• Abstract categorial grammars with island constraints and effective decidability