CoqPL 2023 Contributors

Sat 21 Jan 2023 Boston, Massachusetts, United States

co-located with POPL 2023

Filter

Role Type

Contributing to

Number of Roles

Country

Results (32)

A Benedikt AhrensAhrens, Benedikt TU Delft, The NetherlandsNetherlands Formalizing Monoidal Categories and Actions for Syntax with Binders
Danil AnnenkovAnnenkov, Danil ConcordiumDenmark Committee Member in Program Committee within the CoqPL-track
Clément AubertAubert, Clément Augusta UniversityUnited States Certifying Complexity Analysis
Arthur Azevedo de AmorimAzevedo de Amorim, Arthur Boston UniversityUnited States Verified Differential Privacy for Finite Computers
B Yves BertotBertot, Yves INRIAFrance Session with the Coq Development Team
C Qinxiang CaoCao, Qinxiang Shanghai Jiao Tong UniversityChina Interactive Theorem Proving in Logic Education：A Coq Formalization of ZFC Set Theory for Discrete Mathematics Teaching Committee Member in Program Committee within the CoqPL-track
Tej ChajedChajed, Tej VMware ResearchUnited States Co-chair in Program Committee within the CoqPL-track
Kaustuv ChaudhuriChaudhuri, Kaustuv INRIA & LIX, IPP Integrating graphical proofs in Coq
Adam ChlipalaChlipala, Adam Massachusetts Institute of TechnologyUnited States Pyrosome: A Framework for Modular, Extensible, Equivalence-Preserving Compilation
D Pablo DonatoDonato, Pablo Ecole polytechnique Integrating graphical proofs in Coq
Maxime DénèsDénès, Maxime Inria Session with the Coq Development Team
Maxime DénèsDénès, Maxime INRIA Committee Member in Program Committee within the CoqPL-track
F Christopher W. FletcherFletcher, Christopher W. University of Illinois Urbana-Champaign Towards Formally Verified Path ORAM in Coq
G Marco GaboardiGaboardi, Marco Boston UniversityUnited States Verified Differential Privacy for Finite Computers
Samuel GruetterGruetter, Samuel Massachusetts Institute of Technology Omnisemantics: Smooth Handling of Nondeterminism (Invited talk)
H Hugo HerbelinHerbelin, Hugo Inria Committee Member in Program Committee within the CoqPL-track
J Dustin JamnerJamner, Dustin MIT CSAIL Pyrosome: A Framework for Modular, Extensible, Equivalence-Preserving Compilation
K Gabriel KammerKammer, Gabriel MIT Pyrosome: A Framework for Modular, Extensible, Equivalence-Preserving Compilation
L Hannah LeungLeung, Hannah University of Illinois Urbana-ChampaignUnited States Towards Formally Verified Path ORAM in Coq
M Ralph MatthesMatthes, Ralph IRIT (CNRS and Univ. of Toulouse) Formalizing Monoidal Categories and Actions for Syntax with Binders
P Zoe ParaskevopoulouParaskevopoulou, Zoe Northeastern UniversityUnited States Committee Member in Program Committee within the CoqPL-track
Benjamin C. PiercePierce, Benjamin C. University of PennsylvaniaUnited States Co-chair in Program Committee within the CoqPL-track
Clément Pit-ClaudelPit-Claudel, Clément EPFL / AWSUnited States Committee Member in Program Committee within the CoqPL-track
R Vivien RindisbacherRindisbacher, Vivien Boston UniversityUnited States Verified Differential Privacy for Finite Computers
Talia RingerRinger, Talia University of Illinois at Urbana-ChampaignUnited States Towards Formally Verified Path ORAM in Coq Committee Member in Program Committee within the CoqPL-track
Christine RizkallahRizkallah, Christine University of MelbourneAustralia Committee Member in Program Committee within the CoqPL-track
Thomas RubianoRubiano, Thomas LIPN – UMR 7030 Université Sorbonne Paris Nord Certifying Complexity Analysis
Neea RuschRusch, Neea Augusta UniversityUnited States Certifying Complexity Analysis
S Thomas SeillerSeiller, Thomas CNRSFrance Certifying Complexity Analysis
W Xinyi WanWan, Xinyi Shanghai Jiao Tong University Interactive Theorem Proving in Logic Education：A Coq Formalization of ZFC Set Theory for Discrete Mathematics Teaching
Benjamin WernerWerner, Benjamin LIX, IPP Integrating graphical proofs in Coq
Kobe WullaertWullaert, Kobe Technical University Delft Formalizing Monoidal Categories and Actions for Syntax with Binders