Download PDFOpen PDF in browserSubstructural Calculi with Dependent TypesEasyChair Preprint 4217 pages•Date: August 10, 2018AbstractIn this paper, we investigate how to introduce dependent types into the substructural calculi such as the Lambek calculus and linear logic. The motivations of such a move include facilitating a closer correspondence between syntax and semantics in natural language analysis and developing promising applications such as that to concurrency through dependent session types. We shall present two substructural calculi with dependent types: the first containing dependent Lambek types and the second dependent linear types. Technically, the former adheres to the usual assumption that types do not depend on substructural variables (in this case, the Lambek variables), which makes the technical development easier, while the latter allows type dependency on linear variables, which makes the development more challenging as well as more interesting in applications. Keyphrases: Lambek calculus, dependent types, linear logic, substructural calculus
|