Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn program verification in Agda through a focused tutorial that explores binary search algorithms with a positive approach, presented by Alexander Dinges and Ralf Hinze from RPTU Kaiserslautern-Landau at the International Conference on Functional Programming (ICFP) 2025. Discover how to apply formal verification techniques to one of computer science's fundamental algorithms while gaining hands-on experience with Agda's dependent type system. Explore the mathematical foundations and proof strategies needed to verify correctness properties of binary search implementations, emphasizing constructive and positive reasoning approaches that make verification more intuitive and accessible.
