Syntactic calculus with dependent types

DOI10.1023/A:1008390927185MaRDI QIDQ1280047zbMATH OpenOpenAlexFDO

Authors Aarne Ranta

Publication date 31 August 1999

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008390927185

zbMATH Keywords

constructive type theoryLambek calculussyntactic calculussyntax trees

Mathematics Subject Classification ID

Logic of natural languages (03B65) Second- and higher-order arithmetic and fragments (03F35) Natural language processing (68T50)

Review text

The paper is a description of the syntactic calculus of Bar-Hillel and Lambek, considered from the point of view of constructive type theory. As basic tool of the formalization a notion of dependent types has been used. The presented approach is based on syntax trees as the main alternative of formalization. The paper does not contain new mathematical results but focuses on linguistics illustrations of some formalism.

Recommendations

• On the directional Lambek calculus
• scientific article; zbMATH DE number 1241699
• scientific article; zbMATH DE number 4162855

Cited in

(5)

• Dependently Typed Grammars
• A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family
• scientific article; zbMATH DE number 2087549 (Why is no real title available?)
• Dot-types and their implementation
• A dependent dependency calculus

This page was built for publication: Syntactic calculus with dependent types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280047)