Paul He
Orcid: 0000-0002-6305-4335Affiliations:
- University of Toronto, Department of Computer Science, Toronto, ON, Canada
- University of Pennsylvania (UPenn), Department of Computer and Information Science, Philadelphia, PA, USA (former, PhD)
- University of Waterloo, ON, Canada (former)
According to our database1,
Paul He authored at least 12 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on paulhe.com
-
on orcid.org
-
on github.com
On csauthors.net:
Bibliography
2025
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq.
J. Funct. Program., 2025
Alternative Grading at Scale: Insights from Implementing Weekly Checkpoint Quizzes in a Large Introductory CS Course.
Proceedings of the 25th Koli Calling International Conference on Computing Education Research, 2025
2023
Proc. ACM Program. Lang., January, 2023
Dagstuhl Artifacts Ser., 2023
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023
2021
A type system for extracting functional specifications from memory-safe imperative programs.
Proc. ACM Program. Lang., 2021
2020
Proc. ACM Program. Lang., 2020
An equational theory for weak bisimulation via generalized parameterized coinduction.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020
2019
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).
CoRR, 2019
2018
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.
CoRR, 2018
Proceedings of the Reachability Problems - 12th International Conference, 2018
2017