@article{dmtcs:4748,
    title      = {A Type System Describing Unboundedness},
    author     = {Paweł Parys},
    url        = {https://dmtcs.episciences.org/4748},
    doi        = {10.23638/DMTCS-22-4-2},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {vol. 22 no. 4},
    issuetitle = {Automata, Logic and Semantics},
    eid        = 2,
    year       = {2020},
    month      = {Aug},
    keywords   = {simultaneous-unboundedness problem, higher-order recursion schemes, intersection types, reflection, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]},
    language   = {English},
}