pdfformat: 

@InProceedings{guglielmi_et_al:LIPIcs:2010:2649, author = {Alessio Guglielmi and Tom Gundersen and Michel Parigot}, title = {{A Proof Calculus Which Reduces Syntactic Bureaucracy}}, booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications}, pages = {135150}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897187}, ISSN = {18688969}, year = {2010}, volume = {6}, editor = {Christopher Lynch}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2649}, URN = {urn:nbn:de:0030drops26490}, doi = {10.4230/LIPIcs.RTA.2010.135}, annote = {Keywords: Logic, Proof theory, Deep Inference, Flow graphs, Proof Systems, Open Deduction, Rewriting, Confluence, Termination} }
Keywords:  Logic, Proof theory, Deep Inference, Flow graphs, Proof Systems, Open Deduction, Rewriting, Confluence, Termination  
Seminar:  Proceedings of the 21st International Conference on Rewriting Techniques and Applications  
Issue date:  2010  
Date of publication:  06.07.2010 