A Datalog Recognizer for Almost Affine λ-CFGs

DOI10.1007/978-3-642-23211-4_2zbMATH Open1348.68276OpenAlexW1165981MaRDI QIDQ3172825

Pierre Bourreau, S. Salvati

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_2

zbMATH Keywords

Datalogparsingabstract categorial grammarscontext-free \(\lambda \)-grammarsdeleting grammarstyping properties

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Combinatory logic and lambda calculus (03B40)

Cites Work

• On the membership problem for non-linear abstract categorial grammars
• An extension of basic functionality theory for \(\lambda\)-calculus
• Uniqueness of normal proofs in implicational intuitionistic logic
• Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus

Related Items (2)

DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ The IO and OI hierarchies revisited

Uses Software

• Datalog

This page was built for publication: A Datalog Recognizer for Almost Affine λ-CFGs

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