@inproceedings{parys:LIPIcs:2018:8512,
Address = {Dagstuhl, Germany},
Annote = {Keywords: higher-order recursion schemes, intersection types, WMSO+U logic, boundedness},
Author = {Parys, Pawel},
BookTitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
Editor = {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
File = {LIPIcs-STACS-2018-53 (0) - a - a - s.pdf},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
Keywords = {citesme!},
Pages = {53:1--53:16},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Recursion Schemes and the WMSO+U Logic}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8512},
Volume = {96},
Year = {2018},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/8512},
bdsk-url-2 = {https://dx.doi.org/10.4230/LIPIcs.STACS.2018.53},
date-added = {2018-03-08 11:03:09 +0000},
date-modified = {2018-03-08 11:03:15 +0000},
file-2 = {slides-2017-fit (0) - a - a - s.pdf},
file-3 = {HIGHLIGHTS17\_paper\_11 (0) - a - a - s.pdf},
urn = {urn:nbn:de:0030-drops-85122},
doi = {10.4230/LIPIcs.STACS.2018.53}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A