Research Scientist, Inria (French: chargé de recherche)
Lecturer (part-time), École polytechnique (French: chargé d’enseignement)
1 rue Honoré d’Estienne d’Orves
Campus de l’École Polytechnique
91120 Palaiseau, France (map)
- LSFA 2016: Workshop on Logical and Semantic Frameworks, with Applications (invited speaker)
- WoF 2015: International Workshop on Focusing (PC member)
- FICS 2015: International Workshop on Fixed Points in Computer Science (PC member)
- Abella Tutorial @ CADE 2015 (Co-organizer with G. Nadathur)
LFMTP 2015: Logical Frameworks and Meta-Languages: Theory and Practice (PC co-chair with
I. Cervesato and K. Chaudhuri. Proceedings of the 10th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP). EPTCS v.185. .
- CPP 2015: ACM-SIGPLAN Conference on Certified Programs and Proofs (PC member)
- LFMTP 2014: Logical Frameworks and Meta-Languages: Theory and Practice (PC member)
- LINEARITY 2014: International Workshop on Linearity (PC member)
- SD 2014: International Workshop on Structures and Deduction (PC co-chair with L. Straßburger and W. Heijltjes)
- ICLP 2014: International Confernece on Logic Programming (PC member)
Recent papers and drafts
T. Brock-Nannestad and K. Chaudhuri. Saturation-based Countermodel Construction for Propositional Intuitionistic Logic. Draft manuscript. Submitted. .
The algorithm presented in this paper has been implemented in Mætning version 0.3.0.
- K. Chaudhuri, S. Marin, and L. Straßburger. Focused and Synthetic Nested Sequents. Accepted to the International Conference on Foundations of Software Science and Computation Structures (FoSSaCS-19), Eindhoven, Netherlands. Draft of January 2016. . ©Springer. Technical report with full proofs.
- K. Chaudhuri. Encoding Additives Using Multiplicatives and Subexponentials. To appear in Mathematical Structures in Computer Science. Draft of August 2015. .
- K. Chaudhuri and G. Reis. An adequate compositional encoding of bigraph structure in linear logic with subexponentials. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-20), Suva, Fiji. LNCS 9450, pp. 146–161. . ©Springer
- T. Brock-Nannestad and K. Chaudhuri. Disproving Using the Inverse Method by Iterated Refinement of Finite Approximations. Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-24), Wrocław, Poland. LNCS 9323, pp. 153–168. . ©Springer. See the associated theorem prover, Mætning.
- Y. Wang and K. Chaudhuri. A Proof-Theoretic Characterization of Independence in Type Theory. International Conference on Typed Lambda Calculi and Applications (TLCA-13), Warsaw, Poland. LIPIcs v.38, pp. 332–346. . This paper has a dedicated web-page.
- INF 321: Les principes des langages de programmation (Principles of Programming Languages), TD, Spring 2015, École polytechnique
- INF 431: Programmation d’applications concurrentes et distribuées (Concurrent and Distributed Programming), TD, Spring 2015, École polytechnique
- INF 321: Les principes des langages de programmation (Principles of Programming Languages), TD, Spring 2014, École polytechnique