@article{Parys:DMTCS:2020,
    Author = {Parys, Pawe{\l}},
    File = {A Type System Describing Unboundedness - hal-01850934.pdf},
    Journal = {{Discrete Mathematics \& Theoretical Computer Science}},
    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]},
    Month = {August},
    Title = {{A Type System Describing Unboundedness}},
    URL = {https://dmtcs.episciences.org/6716},
    Volume = {{vol. 22 no. 4}},
    Year = {2020},
    bdsk-url-1 = {https://dmtcs.episciences.org/6716},
    bdsk-url-2 = {https://doi.org/10.23638/DMTCS-22-4-2},
    date-added = {2023-05-25 16:24:17 +0200},
    date-modified = {2023-05-25 16:24:27 +0200},
    doi = {10.23638/DMTCS-22-4-2}
}

@article{Parys:DMTCS:2020, Author = {Parys, Pawe{\l}}, File = {A Type System Describing Unboundedness - hal-01850934.pdf}, Journal = {{Discrete Mathematics \& Theoretical Computer Science}}, 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]}, Month = {August}, Title = {{A Type System Describing Unboundedness}}, URL = {https://dmtcs.episciences.org/6716}, Volume = {{vol. 22 no. 4}}, Year = {2020}, bdsk-url-1 = {https://dmtcs.episciences.org/6716}, bdsk-url-2 = {https://doi.org/10.23638/DMTCS-22-4-2}, date-added = {2023-05-25 16:24:17 +0200}, date-modified = {2023-05-25 16:24:27 +0200}, doi = {10.23638/DMTCS-22-4-2} }