Julien Truffaut
Papers
1
Total Citations
6
H-Index
1
About
Julien Truffaut is a logician and computer scientist whose research bridges proof theory, modal logic, and the foundations of programming languages. His most-cited work, "Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators" (2013, 6 citations), introduces a cut-free nested sequent calculus for an intuitionistic modal logic that formalizes actions and propositions. A key contribution is the development of a proof search procedure for a dynamic modality—the weakest precondition from program logics—and its left adjoint, which Truffaut terms “update.” This work provides a rigorous algebraic and proof-theoretic framework for reasoning about state change and action effects, with applications in verification and knowledge representation. Though his citation count is modest, Truffaut’s contributions are notable for their technical depth and conceptual clarity, offering a novel perspective on adjoint modalities in intuitionistic settings. His research is of particular interest to scholars working on substructural logics, type theory, and the semantics of imperative programming.
Research Focus
Key Achievements
Top Papers
- 1