default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenji Maillard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Arthur Adjedj, Meven Lennon-Bertrand
, Kenji Maillard, Pierre-Marie Pédrot, Loïc Pujet:
Martin-Löf à la Coq. CPP 2024: 230-245- [c7]Théo Laurent, Meven Lennon-Bertrand, Kenji Maillard:
Definitional Functoriality for Dependent (Sub)Types. ESOP (1) 2024: 302-331 - [c6]Théo Laurent, Meven Lennon-Bertrand, Kenji Maillard:
Artifact Description - Definitional Functoriality for Dependent (Sub)Types. ESOP (1) 2024: 332-337 - 2023
- [j6]Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Carmine Abate, Nikolaj Sidorenco, Catalin Hritcu, Kenji Maillard, Bas Spitters:
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. ACM Trans. Program. Lang. Syst. 45(3): 15:1-15:61 (2023) - [i10]Arthur Adjedj, Meven Lennon-Bertrand, Kenji Maillard, Pierre-Marie Pédrot, Loïc Pujet:
Martin-Löf à la Coq. CoRR abs/2310.06376 (2023) - [i9]Théo Laurent, Meven Lennon-Bertrand, Kenji Maillard:
Definitional Functoriality for Dependent (Sub)Types. CoRR abs/2310.14929 (2023) - 2022
- [j5]Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter:
A reasonably gradual type theory. Proc. ACM Program. Lang. 6(ICFP): 931-959 (2022) - [j4]Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau, Éric Tanter:
Gradualizing the Calculus of Inductive Constructions. ACM Trans. Program. Lang. Syst. 44(2): 7:1-7:82 (2022) - [i8]Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter:
A Reasonably Gradual Type Theory. CoRR abs/2209.00975 (2022) - 2021
- [c5]Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Catalin Hritcu, Kenji Maillard, Bas Spitters:
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. CSF 2021: 1-15 - [i7]Kenji Maillard, Nicolas Margulies, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter:
The Multiverse: Logical Modularity for Proof Assistants. CoRR abs/2108.10259 (2021) - [i6]Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Catalin Hritcu, Kenji Maillard, Bas Spitters:
SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. IACR Cryptol. ePrint Arch. 2021: 397 (2021) - 2020
- [j3]Kenji Maillard, Catalin Hritcu, Exequiel Rivas, Antoine Van Muylder:
The next 700 relational program logics. Proc. ACM Program. Lang. 4(POPL): 4:1-4:33 (2020) - [i5]Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau, Éric Tanter:
Gradualizing the Calculus of Inductive Constructions. CoRR abs/2011.10618 (2020)
2010 – 2019
- 2019
- [b1]Kenji Maillard:
Principles of Program Verification for Arbitrary Monadic Effects. (Principes de la Vérification de Programmes à Effets Monadiques Arbitraires). École Normale Supérieure, Paris, France, 2019 - [j2]Kenji Maillard, Danel Ahman, Robert Atkey, Guido Martínez, Catalin Hritcu, Exequiel Rivas, Éric Tanter:
Dijkstra monads for all. Proc. ACM Program. Lang. 3(ICFP): 104:1-104:29 (2019) - [i4]Kenji Maillard, Danel Ahman, Robert Atkey, Guido Martínez, Catalin Hritcu, Exequiel Rivas, Éric Tanter:
Dijkstra Monads for All. CoRR abs/1903.01237 (2019) - [i3]Kenji Maillard, Catalin Hritcu, Exequiel Rivas, Antoine Van Muylder:
The Next 700 Relational Program Logics. CoRR abs/1907.05244 (2019) - 2018
- [j1]Danel Ahman, Cédric Fournet, Catalin Hritcu, Kenji Maillard, Aseem Rastogi, Nikhil Swamy:
Recalling a witness: foundations and applications of monotonic state. Proc. ACM Program. Lang. 2(POPL): 65:1-65:30 (2018) - [c4]Niklas Grimm, Kenji Maillard, Cédric Fournet, Catalin Hritcu, Matteo Maffei, Jonathan Protzenko, Tahina Ramananandro, Aseem Rastogi, Nikhil Swamy, Santiago Zanella Béguelin:
A monadic framework for relational verification: applied to information security, program equivalence, and optimizations. CPP 2018: 130-145 - 2017
- [c3]Danel Ahman, Catalin Hritcu, Kenji Maillard, Guido Martínez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy:
Dijkstra monads for free. POPL 2017: 515-529 - [c2]Karthikeyan Bhargavan, Barry Bond, Antoine Delignat-Lavaud, Cédric Fournet, Chris Hawblitzel, Catalin Hritcu, Samin Ishtiaq, Markulf Kohlweiss, K. Rustan M. Leino, Jay R. Lorch, Kenji Maillard, Jianyang Pan, Bryan Parno, Jonathan Protzenko, Tahina Ramananandro, Ashay Rane, Aseem Rastogi, Nikhil Swamy, Laure Thompson, Peng Wang, Santiago Zanella Béguelin, Jean Karim Zinzindohoue:
Everest: Towards a Verified, Drop-in Replacement of HTTPS. SNAPL 2017: 1:1-1:12 - [i2]Niklas Grimm, Kenji Maillard, Cédric Fournet, Catalin Hritcu, Matteo Maffei, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy, Santiago Zanella Béguelin:
A Monadic Framework for Relational Verification (Functional Pearl). CoRR abs/1703.00055 (2017) - [i1]Danel Ahman, Cédric Fournet, Catalin Hritcu, Kenji Maillard, Aseem Rastogi, Nikhil Swamy:
Recalling a Witness: Foundations and Applications of Monotonic State. CoRR abs/1707.02466 (2017) - 2015
- [c1]Kenji Maillard, Paul-André Melliès:
A Fibrational Account of Local States. LICS 2015: 402-413
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
