Théo Winterhalter

Orcid: 0000-0002-9881-3696

According to our database1, Théo Winterhalter authored at least 24 papers between 2015 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The Rewster: Type Preserving Rewrite Rules for the Rocq Prover.
J. Autom. Reason., June, 2026

Misquoted No More: Securely Extracting F* Programs with IO.
CoRR, February, 2026

Bounded Sort Polymorphism with Elimination Constraints.
Proc. ACM Program. Lang., 2026

Encode the Cake and Eat It Too: Controlling Computation in Type Theory, Locally.
Proc. ACM Program. Lang., 2026

2025
Correct and Complete Type Checking and Certified Erasure for Coq, in Coq.
J. ACM, February, 2025

SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F.
Proc. ACM Program. Lang., 2025

2024
Securing Verified IO Programs Against Unverified Code in F.
Proc. ACM Program. Lang., January, 2024

Dependent Ghosts Have a Reflection for Free.
Proc. ACM Program. Lang., 2024

From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory.
CoRR, 2024

The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

Impredicativity, Cumulativity and Product Covariance in the Logical Framework Dedukti.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography.
Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2023
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
ACM Trans. Program. Lang. Syst., September, 2023

Securely Compiling Verified F* Programs With IO.
CoRR, 2023

2021
The taming of the rew: a type theory with computational assumptions.
Proc. ACM Program. Lang., 2021

SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Formalisation and Meta-Theory of Type Theory. (Formalisation et Méta-Théorie de la Théorie des Types).
PhD thesis, 2020

Coq Coq correct! verification of type checking and erasure for Coq, in Coq.
Proc. ACM Program. Lang., 2020

The MetaCoq Project.
J. Autom. Reason., 2020

2019
Eliminating reflection from type theory.
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018
Randomized Mixed-Radix Scalar Multiplication.
IEEE Trans. Computers, 2018

2017
Normalization by evaluation for sized dependent types.
Proc. ACM Program. Lang., 2017

2015
Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences.
IACR Cryptol. ePrint Arch., 2015


  Loading...