Lecture

Verified Functional Programming: Nicolas Voirol public PhD thesis defense

Description

This lecture covers the concept of verified functional programming, emphasizing the importance of formal verification in software development to prevent catastrophic bugs. It explores the challenges of verifying programs, the benefits of functional programming, and the use of SMT solvers for counterexample finding. The lecture delves into type checking, bidirectional type checking, and the encoding of Scala language features. It also discusses automation, improvements in program verification, and the theoretical results of counterexample finding. The presentation concludes with the application of dependent types, Scala program transformations, and the enforcement of laws in program design.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.