Paul He

Orcid: 0000-0002-6305-4335

According to our database¹, Paul He authored at least 10 papers between 2017 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., January, 2023

Semantics for Noninterference with Interaction Trees (Artifact).

[BibT_eX]

[DOI]

Dagstuhl Artifacts Ser., 2023

Semantics for Noninterference with Interaction Trees.

[BibT_eX]

[DOI]

Proceedings of the 37th European Conference on Object-Oriented Programming, 2023

2021

A type system for extracting functional specifications from memory-safe imperative programs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2021

2020

Interaction trees: representing recursive and impure programs in Coq.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

An equational theory for weak bisimulation via generalized parameterized coinduction.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

CoRR, 2019

2018

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.

[BibT_eX]

[DOI]

CoRR, 2018

The Satisfiability of Word Equations: Decidable and Undecidable Theories.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 12th International Conference, 2018

2017

A simple soundness proof for dependent object types.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2017

Paul He

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...