Julien Truffaut

Learn More
We develop a cut-free nested sequent calculus as basis for a proof search procedure for an intuitionistic modal logic of actions and propositions. The actions act on propositions via a dynamic modality (the <i>weakest precondition</i> of program logics), whose left adjoint we refer to as &#8220;update&#8221; (the <i>strongest postcondition</i>). The logic(More)
  • 1