@inproceedings{BarozziniParysWroblewski:ICALP:2022,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: Higher-order recursion schemes, boundedness, intersection types, safe schemes},
    Author = {Barozzini, David and Parys, Pawe{{\l}} and Wr\'{o}blewski, Jan},
    BookTitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
    Editor = {Boja\'{n}czyk, Miko{{\l}}aj and Merelli, Emanuela and Woodruff, David P.},
    File = {Unboundedness for Recursion Schemes- A Simpler Type System - LIPIcs-ICALP-2022-112.pdf},
    ISBN = {978-3-95977-235-8},
    ISSN = {1868-8969},
    Pages = {112:1--112:19},
    Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Unboundedness for Recursion Schemes: A Simpler Type System}},
    URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16453},
    Volume = {229},
    Year = {2022},
    bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2022/16453},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2022.112},
    date-added = {2023-05-25 16:26:53 +0200},
    date-modified = {2023-05-25 16:27:38 +0200},
    urn = {urn:nbn:de:0030-drops-164533},
    doi = {10.4230/LIPIcs.ICALP.2022.112}
}

@inproceedings{BarozziniParysWroblewski:ICALP:2022, Address = {Dagstuhl, Germany}, Annote = {Keywords: Higher-order recursion schemes, boundedness, intersection types, safe schemes}, Author = {Barozzini, David and Parys, Pawe{{\l}} and Wr\'{o}blewski, Jan}, BookTitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, Editor = {Boja\'{n}czyk, Miko{{\l}}aj and Merelli, Emanuela and Woodruff, David P.}, File = {Unboundedness for Recursion Schemes- A Simpler Type System - LIPIcs-ICALP-2022-112.pdf}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, Pages = {112:1--112:19}, Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Unboundedness for Recursion Schemes: A Simpler Type System}}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16453}, Volume = {229}, Year = {2022}, bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2022/16453}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2022.112}, date-added = {2023-05-25 16:26:53 +0200}, date-modified = {2023-05-25 16:27:38 +0200}, urn = {urn:nbn:de:0030-drops-164533}, doi = {10.4230/LIPIcs.ICALP.2022.112} }