Ideally we would obtain a way to formally prove that Kiama-based components were doing the correct things.Evaluating Dependently Typed Programming in AGDA (Verity)On the one hand, AGDA is a dependently typed functional programming language, which owes much of its design to popular mainstream strongly typed languages such as ML and Haskell.