  A semantical embedding of input/output logic in classical higher-order logic
is presented. This embedding enables the mechanisation and automation of
reasoning tasks in input/output logic with off-the-shelf higher-order theorem
provers and proof assistants. The key idea for the solution presented here
results from the analysis of an inaccurate previous embedding attempt, which we
will discuss as well.
