pdfformat: 

@InProceedings{kanovich_et_al:LIPIcs:2017:7738, author = {Max Kanovich and Stepan Kuznetsov and Glyn Morrill and Andre Scedrov}, title = {{A PolynomialTime Algorithm for the Lambek Calculus with Brackets of Bounded Order}}, booktitle = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)}, pages = {22:122:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770477}, ISSN = {18688969}, year = {2017}, volume = {84}, editor = {Dale Miller}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7738}, URN = {urn:nbn:de:0030drops77387}, doi = {10.4230/LIPIcs.FSCD.2017.22}, annote = {Keywords: Lambek calculus, proof nets, Lambek calculus with brackets, categorial grammar, polynomial algorithm} }
Keywords:  Lambek calculus, proof nets, Lambek calculus with brackets, categorial grammar, polynomial algorithm  
Seminar:  2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)  
Issue date:  2017  
Date of publication:  2017 