An interview with Michal Gajda exploring how Haskell's strong type system, purity, and functional abstractions apply to bioinformatics and biological data processing. Drawing on projects like hPDB (a highly scalable Protein Data Bank parser), JSON Autotype, and XML TypeLift, Gajda argues that Haskell's greatest strength is strongly typed pure functional programming rather than laziness, enabling linear multicore scalability. He discusses the challenges of handling diverse, large-scale biotech data formats, compares Haskell with OCaml, PureScript, and Agda, and identifies education and beginner-friendly tooling as the main barriers to wider adoption. He also sees AI-assisted programming as a potential path to making functional languages more accessible to junior scientists.