APA (7th ed.) Citation

Parys, P. (2020). A Type System Describing Unboundedness. Discrete Mathematics and Theoretical Computer Science, 22 no. 4(Automata, Logic and Semantics), 1-84. https://doi.org/10.23638/DMTCS-22-4-2

Chicago Style (17th ed.) Citation

Parys, Paweł. "A Type System Describing Unboundedness." Discrete Mathematics and Theoretical Computer Science 22 no. 4, no. Automata, Logic and Semantics (2020): 1-84. https://doi.org/10.23638/DMTCS-22-4-2.

MLA (9th ed.) Citation

Parys, Paweł. "A Type System Describing Unboundedness." Discrete Mathematics and Theoretical Computer Science, vol. 22 no. 4, no. Automata, Logic and Semantics, 2020, pp. 1-84, https://doi.org/10.23638/DMTCS-22-4-2.