Nathan Hurtig
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nathan Hurtig has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Adriana Schulz
Computer Science Department, Brown University, Providence, Rhode Island, USA
1 shared publication - Gilbert Bernstein
University of Washington, Seattle, USA
1 shared publication - James McCann
Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
1 shared publication - Jenny Han Lin
University of Utah, Salt Lake City, USA
1 shared publication - Thomas S. Price
Wellcome Trust Centre for Human Genetics, University of Oxford, UK
1 shared publication
Latest Publications
- Open Access
- 5 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (ICFP) , 371-399
Polynomial-Time Program Equivalence for Machine Knitting
We present an algorithm that canonicalizes the algebraic representations of the topological semantics of machine knitting programs. Machine knitting is a staple technology of modern textile production where hundreds of mechanical needles are manipulated to form yarn into interlocking loop structures. Our semantics are defined using a variant of a monoidal category, and they closely correspond to string diagrams. We formulate our canonicalization as an Abstract Rewriting System (ARS) over words in our category, and prove that our algorithm is correct and runs in polynomial time.
- 5 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (ICFP) , 371-399
Open AccessPolynomial-Time Program Equivalence for Machine Knitting
We present an algorithm that canonicalizes the algebraic representations of the topological semantics of machine knitting programs. Machine knitting is a staple technology of modern textile production where hundreds of mechanical needles are manipulated to form yarn into interlocking loop structures. Our semantics are defined using a variant of a monoidal category, and they closely correspond to string diagrams. We formulate our canonicalization as an Abstract Rewriting System (ARS) over words in our category, and prove that our algorithm is correct and runs in polynomial time.