Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{parys:LIPIcs:2018:8375, author = {Pawel Parys}, title = {{The Complexity of the Diagonal Problem for Recursion Schemes}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {45:145:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770552}, ISSN = {18688969}, year = {2018}, volume = {93}, editor = {Satya Lokam and R. Ramanujam}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8375}, URN = {urn:nbn:de:0030drops83757}, doi = {10.4230/LIPIcs.FSTTCS.2017.45}, annote = {Keywords: diagonal problem, higherorder recursion schemes, intersection types, downward closure} }
Keywords:  diagonal problem, higherorder recursion schemes, intersection types, downward closure  
Seminar:  37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)  
Issue Date:  2018  
Date of publication:  26.01.2018 