the security engended by type-checking in functional programming

No. Dependently-typed theorem proving is the only thing safe enough ;-). That, or the kind of probabilistic defense-in-depth that comes from specifying uncertainty about the goal system and other aspects of the agent's functioning, thus ensuring that updating on data will make the agent converge to the right thing.