Paul He
Paul He
Verified email at cis.upenn.edu - Homepage
Title
Cited by
Cited by
Year
The Satisfiability of Word Equations: Decidable and Undecidable Theories
JD Day, V Ganesh, P He, F Manea, D Nowotka
International Conference on Reachability Problems, 15-29, 2018
18*2018
Interaction trees: representing recursive and impure programs in Coq
L Xia, Y Zakowski, P He, CK Hur, G Malecha, BC Pierce, S Zdancewic
Proceedings of the 47th Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2020
172020
A simple soundness proof for dependent object types
M Rapoport, I Kabir, P He, O Lhoták
Proceedings of the ACM on Programming Languages 1 (OOPSLA), 46, 2017
132017
An equational theory for weak bisimulation via generalized parameterized coinduction
Y Zakowski, P He, CK Hur, S Zdancewic
Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–4