Dal Lago, U. (2022). Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann. Mathematical structures in computer science, 32(6), 760-776. https://doi.org/10.1017/S0960129521000505
Citace podle Chicago (17th ed.)Dal Lago, U. "Implicit Computation Complexity in Higher-order Programming Languages: A Survey in Memory of Martin Hofmann." Mathematical Structures in Computer Science 32, no. 6 (2022): 760-776. https://doi.org/10.1017/S0960129521000505.
Citace podle MLA (9th ed.)Dal Lago, U. "Implicit Computation Complexity in Higher-order Programming Languages: A Survey in Memory of Martin Hofmann." Mathematical Structures in Computer Science, vol. 32, no. 6, 2022, pp. 760-776, https://doi.org/10.1017/S0960129521000505.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..