Follow
Paul He
Title
Cited by
Cited by
Year
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
159*2020
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
43*2018
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
232017
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
222020
Choice trees: Representing nondeterministic, recursive, and impure programs in coq
N Chappe, P He, L Henrio, Y Zakowski, S Zdancewic
Proceedings of the ACM on Programming Languages 7 (POPL), 1770-1800, 2023
172023
A type system for extracting functional specifications from memory-safe imperative programs
P He, E Westbrook, B Carmer, C Phifer, V Robert, K Smeltzer, ...
Proceedings of the ACM on Programming Languages 5 (OOPSLA), 1-29, 2021
62021
Semantics for Noninterference with Interaction Trees
L Silver, P He, E Cecchetti, AK Hirsch, S Zdancewic
37th European Conference on Object-Oriented Programming (ECOOP 2023), 2023
5*2023
Choice Trees: Representing and Reasoning About Nondeterministic, Recursive, and Impure Programs in Coq (draft)
N CHAPPE, P HE, L HENRIO, E IOANNIDIS, Y ZAKOWSKI, ...
The system can't perform the operation now. Try again later.
Articles 1–8