The complex(ity) landscape of checking infinite descent

Cohen, L. orcid.org/0000-0002-6608-3000, Jabarin, A. orcid.org/0009-0006-1519-7661, Popescu, A. orcid.org/0000-0001-8747-0619 et al. (1 more author) (2024) The complex(ity) landscape of checking infinite descent. In: Hicks, M., (ed.) Proceedings of the ACM on Programming Languages. 50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023), 15-21 Jan 2023, Boston, Massachusetts, United States. Association for Computing Machinery (ACM) , pp. 1352-1384.

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Hicks, M.
Copyright, Publisher and Additional Information:

© 2024 Owner/Author. This work is licensed under a Creative Commons Attribution 4.0 International License. https://creativecommons.org/licenses/by/4.0/

Keywords: Theory Of Computation; Applied Mathematics; Information and Computing Sciences; Pure Mathematics; Mathematical Sciences
Dates:
  • Published: 5 January 2024
  • Published (online): 5 January 2024
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 22 Feb 2024 12:59
Last Modified: 22 Feb 2024 12:59
Status: Published
Publisher: Association for Computing Machinery (ACM)
Refereed: Yes
Identification Number: 10.1145/3632888
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics