Polynomial equivalence among systems LLNC, LLNCa and LLNC0

Authors:
François Métayer
Affiliations:
-
Venue:
Theoretical Computer Science - Special issue on linear logic, 1
Year:
1999

Citing 0
Cited 2

Lambek calculus is NP-complete

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Lambek grammars with the unit

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract