On the expressive power of abstract categorial grammars: Representing context-free formalisms

DOI10.1007/s10849-004-2114-xzbMath1062.03024OpenAlexW2087541147MaRDI QIDQ1770834

Sylvain Pogodalla, Philippe de Groote

Publication date: 7 April 2005

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

Full work available at URL: https://hal.inria.fr/inria-00112956/file/jolli-final.pdf

zbMATH Keywords

context-free grammarslambda-calculusformal language theoryAbstract categorial grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Symmetric categorial grammar ⋮ Natural language semantics and computability ⋮ Abstract Families of Abstract Categorial Languages ⋮ Second-order abstract categorial grammars as hyperedge replacement grammars ⋮ A faithful representation of non-associative Lambek grammars in abstract categorial grammars ⋮ Recognizability in the Simply Typed Lambda-Calculus ⋮ On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar ⋮ MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies

Uses Software

• GF

Cites Work

• Linear logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• On multiple context-free grammars
• Grammatical Framework
• Unnamed Item
• Unnamed Item