A faithful representation of non-associative Lambek grammars in abstract categorial grammars

DOI10.1007/s10849-009-9111-zzbMath1197.03032OpenAlexW2023138907MaRDI QIDQ972436

Christian Retoré, Sylvain Salvati

Publication date: 26 May 2010

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

Full work available at URL: https://hal.inria.fr/inria-00409557/file/nl_acg_retore_salvati_jolli.pdf

zbMATH Keywords

lambda calculuscategorial grammarformal language theory

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Symmetric categorial grammar

Uses Software

• Grail
• Grail

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• The equivalence problem for deterministic MSO tree transducers is decidable
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A faithful representation of non-associative Lambek grammars in abstract categorial grammars