pdfformat: 

@InProceedings{baillot_et_al:LIPIcs:2016:6580, author = {Patrick Baillot and Anupam Das}, title = {{FreeCut Elimination in Linear Logic and an Application to a Feasible Arithmetic}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {40:140:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770224}, ISSN = {18688969}, year = {2016}, volume = {62}, editor = {JeanMarc Talbot and Laurent Regnier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6580}, URN = {urn:nbn:de:0030drops65807}, doi = {10.4230/LIPIcs.CSL.2016.40}, annote = {Keywords: proof theory, linear logic, bounded arithmetic, polynomial time computation, implicit computational complexity} }
Keywords:  proof theory, linear logic, bounded arithmetic, polynomial time computation, implicit computational complexity  
Seminar:  25th EACSL Annual Conference on Computer Science Logic (CSL 2016)  
Issue date:  2016  
Date of publication:  2016 